Related papers: Local and global universality of random matrix cok…
Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian, we introduce two families of discrete matrix models constructed both with the help of the Erdos-Renyi ensemble of random graphs. Corresponding matrix sums…
We prove universality of local eigenvalue statistics in the bulk of the spectrum for orthogonal invariant matrix models with real analytic potentials with one interval limiting spectrum. Our starting point is the Tracy-Widom formula for the…
In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent…
In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with…
We determine the distribution of the sandpile group (also known as the Jacobian) of the Erd\H{o}s-R\'{e}nyi random graph $G(n,q)$ along with its canonical duality pairing as $n$ tends to infinity, fully resolving a conjecture from 2015 due…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
We link the appearance of universal kernels in random matrix ensembles to the phenomenon of shock formation in some fluid dynamical equations. Such equations are derived from Dyson's random walks after a proper rescaling of the time. In the…
Various ensembles of random matrices with independent entries are analyzed by the replica formalism in the large-N limit. A result on the Laplacian random matrix with Wigner-rescaling is generalized to arbitrary probability distribution.
We present a Gaussian ensemble of random cyclic matrices on the real field and study their spectral fluctuations. These cyclic matrices are shown to be pseudo-symmetric with respect to generalized parity. We calculate the joint probability…
We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…
We construct approximate transport maps for perturbative several-matrix models. As a consequence, we deduce that local statistics have the same asymptotic as in the case of independent GUE or GOE matrices, i.e., they are given by the…
The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality. In the first part of the paper we concentrate…
By the use of extensive numerical simulations we show that the nearest-neighbor energy level spacing distribution $P(s)$ and the entropic eigenfunction localization length of the adjacency matrices of Erd\H{o}s-R\'enyi (ER) {\it fully}…
Consider a random matrix of the form $W_n = M_n + D_n$, where $M_n$ is a Wigner matrix and $D_n$ is a real deterministic diagonal matrix ($D_n$ is commonly referred to as an external source in the mathematical physics literature). We study…
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold…
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…
This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…
We study the distribution of the cokernels of adjacency matrices (the Smith groups) of certain models of random $r$-regular graphs and directed graphs, using recent mixing results of M\'esz\'aros. We explain how convergence of such…
We discuss the concept of width-to-spacing ratio which plays the central role in the description of local spectral statistics of evolution operators in multiplicative and additive stochastic processes for random matrices. We show that the…