Related papers: Calculation of mean spectral density for statistic…

The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…

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…

Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…

We compute the spectral density for ensembles of of sparse symmetric random matrices using replica, managing to circumvent difficulties that have been encountered in earlier approaches along the lines first suggested in a seminal paper by…

We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equations are derived. These equations are generalized to the…

We review the problem of how to compute the spectral density of sparse symmetric random matrices, i.e. weighted adjacency matrices of undirected graphs. Starting from the Edwards-Jones formula, we illustrate the milestones of this line of…

The spectral density of bound pairs in ideal 1D, 2D and Bethe lattices is computed for weak and strong interactions. The computations are performed with Green's functions by an efficient recursion method in real space. For the range of…

We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…

We exhibit an explicit formula for the spectral density of a (large) random matrix which is a diagonal matrix whose spectral density converges, perturbated by the addition of a symmetric matrix with Gaussian entries and a given (small)…

The spectral density of various ensembles of sparse symmetric random matrices is analyzed using the cavity method. We consider two cases: matrices whose associated graphs are locally tree-like, and sparse covariance matrices. We derive a…

In physics, it is sometimes desirable to compute the so-called \emph{Density Of States} (DOS), also known as the \emph{spectral density}, of a real symmetric matrix $A$. The spectral density can be viewed as a probability density…

We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…

This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models,…

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…

We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low…

In random walks, the path representation of the Green's function is an infinite sum over the length of path probability density functions (PDFs). Here we derive and solve, in Laplace space, the recursion relation for the n order path PDF…