Related papers: Native ultrametricity of sparse random ensembles

We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\H{o}s-R\'{e}nyi model, where it settles a conjecture of Hajek [IEEE…

We investigate the eigenvalues statistics of ensembles of normal random matrices when their order N tends to infinite. In the model the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We…

We consider two non-Gaussian ensembles of large Hermitian random matrices with strong level confinement and show that near the soft edge of the spectrum both scaled density of states and eigenvalue correlations follow so-called Airy laws…

Using a nonperturbative approach we examine the large frequency asymptotics of the two-point level density correlator in weakly disordered metallic grains. This allows us to study the behavior of the two-level structure factor close to the…

We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…

Random graph models are used to describe the complex structure of real-world networks in diverse fields of knowledge. Studying their behavior and fitting properties are still critical challenges, that in general, require model specific…

We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…

We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…

We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…

We consider $m$ spinless Bosons distributed over $l$ degenerate single-particle states and interacting through a $k$-body random interaction with Gaussian probability distribution (the Bosonic embedded $k$-body ensembles). We address the…

We consider $N\times N$ Hermitian random matrices with i.i.d. entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. We study the connection between eigenvalue statistics on…

We study the phenomenon of "crowding" near the largest eigenvalue $\lambda_{\max}$ of random $N \times N$ matrices belonging to the Gaussian Unitary Ensemble (GUE) of random matrix theory. We focus on two distinct quantities: (i) the…

The eigenvalue densities of two random matrix ensembles, the Wigner Gaussian matrices and the Wishart covariant matrices, are decomposed in the contributions of each individual eigenvalue distribution. It is shown that the fluctuations of…

The extreme-value statistics of the entanglement spectrum in disordered spin chains possessing a many-body localization transition is examined. It is expected that eigenstates in the metallic or ergodic phase, behave as random states and…

The extreme eigenvalues of adjacency matrices are important indicators on the influences of topological structures to collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme…

We discuss the number-theoretic properties of distributions appearing in physical systems when an observable is a quotient of two independent exponentially weighted integers. The spectral density of ensemble of linear polymer chains…

The spectrum of the nonbacktracking matrix associated to a network is known to contain fundamental information regarding percolation properties of the network. Indeed, the inverse of its leading eigenvalue is often used as an estimate for…

We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo…

This paper examines the relationship between sparse random network architectures and neural network stability by examining the eigenvalue spectral distribution. Specifically, we generalise classical eigenspectral results to sparse…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…