Related papers: Information Geometry of Random Matrix Models
Causal inference is perhaps one of the most fundamental concepts in science, beginning originally from the works of some of the ancient philosophers, through today, but also weaved strongly in current work from statisticians, machine…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We develop an information-theoretic approach to isoperimetric inequalities based on entropy dissipation under heat flow. By viewing diffusion as a noisy information channel, we measure how mutual information about set membership decays over…
We describe a fluctuating volume--current formulation of electromagnetic fluctuations that extends our recent work on heat exchange and Casimir interactions between arbitrarily shaped homogeneous bodies [Phys. Rev. B. 88, 054305] to…
Parameter-dependent statistical properties of spectra of totally connected irregular quantum graphs with Neumann boundary conditions are studied. The autocorrelation functions of level velocities c(x) and c(w,x) as well as the distributions…
We investigate the energetics of droplets sourced by the thermal fluctuations in a system undergoing a first-order transition. In particular, we confine our studies to two dimensions with explicit calulations in the plane and on the sphere.…
Standard diffusion models for graph generation typically rely on uniform time-stepping, an approach that overlooks the non-homogeneous dynamics of distributional evolution on complex manifolds. In this paper, we present an…
Fluctuation geometry was recently proposed as a counterpart approach of Riemannian geometry of inference theory. This theory describes the geometric features of the statistical manifold $\mathcal{M}$ of random events that are described by a…
We use the Kac-Rice formula and results from random matrix theory to obtain the average number of critical points of a family of high-dimensional empirical loss functions, where the data are correlated $d$-dimensional Gaussian vectors,…
Motivated by the problem of inferring the graph structure of functional connectivity networks from multi-level functional magnetic resonance imaging data, we develop a valid inference framework for high-dimensional graphical models that…
Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by…
Diffusion models trained on different, non-overlapping subsets of a dataset often produce strikingly similar outputs when given the same noise seed. We trace this consistency to a simple linear effect: the shared Gaussian statistics across…
We study entropy and optimal transport theory in the free probabilistic setting motivated by the large-$n$ theory of random tuples of matrices. We define a new version of free entropy $\chi_{\operatorname{chron}}^{\mathcal{U}}$, which is…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
We study information matrices for statistical models by the $L^2$-Wasserstein metric. We call them Wasserstein information matrices (WIMs), which are analogs of classical Fisher information matrices. We introduce Wasserstein score functions…
The spatial structure of fluctuations in spatially inhomogeneous processes can be modeled in terms of Gibbs random fields. A local low energy estimator (LLEE) is proposed for the interpolation (prediction) of such processes at points where…
A novel information-geometrodynamical approach to chaotic dynamics (IGAC) on curved statistical manifolds based on Entropic Dynamics (ED) is presented and a new definition of information geometrodynamical entropy (IGE) as a measure of…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
In this work we: (1) review likelihood-based inference for parameter estimation and the construction of confidence regions; and, (2) explore the use of techniques from information geometry, including geodesic curves and Riemann scalar…
In this paper, we first describe the generalized notion of Cramer-Rao lower bound obtained by Naudts (2004) using two families of probability density functions, the original model and an escort model. We reinterpret the results in Naudts…