Related papers: Spectra of large random trees

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

Unitary ensembles of large N x N random matrices with a non-Gaussian probability distribution P[H] ~ exp{-TrV[H]} are studied using a theory of polynomials orthogonal with respect to exponential weights. Asymptotically exact expressions for…

This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…

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 consider the Gaussian ensembles of random matrices and describe the normal modes of the eigenvalue spectrum, i.e., the correlated fluctuations of eigenvalues about their most probable values. The associated normal mode spectrum is…

Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…

We analyse the largest eigenvalue of the adjacency matrix of the configuration model with large degrees, where the latter are treated as hard constraints. In particular, we compute the expectation of the largest eigenvalue for degrees that…

We consider an ensemble of large non-Hermitian random matrices of the form $\hat{H}+i\hat{A}_s$, where $\hat{H}$ and $\hat{A}_s$ are Hermitian statistically independent random $N\times N$ matrices. We demonstrate the existence of a new…

Joint distribution function of N eigenvalues of U(N) invariant random-matrix ensemble can be interpreted as a probability density to find N fictitious non-interacting fermions to be confined in a one-dimensional space. Within this picture a…

We consider random Schr\"odinger operators on tree graphs and prove absolutely continuous spectrum at small disorder for two models. The first model is the usual binary tree with certain strongly correlated random potentials. These…

Theoretical analysis of biological and artificial neural networks e.g. modelling of synaptic or weight matrices necessitate consideration of the generic real-asymmetric matrix ensembles, those with varying order of matrix elements e.g. a…

We consider a set of probability measures on a finite event space $\Omega$. The mutual affinity is introduced in terms of the spectrum of the associated Gram matrix. We show that, for randomly chosen measures, the empirical eigenvalue…

We consider the empirical eigenvalue distribution of an $m\times m$ principle submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. Earlier work of Petz and R\'effy identified the limiting spectral measure…

Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…

It has been observed that the statistical distribution of the eigenvalues of random matrices possesses universal properties, independent of the probability law of the stochastic matrix. In this article we find the correlation functions of…

Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

Consider real symmetric, complex Hermitian Toeplitz and real symmetric Hankel band matrix models, where the bandwidth $b_{N}\ra \iy$ but $b_{N}/N \to b$, $b\in [0,1]$ as $N\to \infty$. We prove that the distributions of eigenvalues converge…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…