Related papers: Universality in the spectral and eigenfunction pro…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
We investigate some topological and spectral properties of Erd\H{o}s-R\'{e}nyi (ER) random digraphs $D(n,p)$. In terms of topological properties, our primary focus lies in analyzing the number of non-isolated vertices $V_x(D)$ as well as…
We provide a general formula for the eigenvalue density of large random $N\times N$ matrices of the form $A = M + LJR$, where $M$, $L$ and $R$ are arbitrary deterministic matrices and $J$ is a random matrix of zero-mean independent and…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
Consider random matrices $A$, of dimension $m\times (m+n)$, drawn from an ensemble with probability density $f(\rmtr AA^\dagger)$, with $f(x)$ a given appropriate function. Break $A = (B,X)$ into an $m\times m$ block $B$ and the…
The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to…
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…
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 present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…
We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…
Energy spectra of disordered systems share a common feature: if the entropy of the quenched disorder is larger than the entropy of the dynamical variables, the spectrum is locally that of a random energy model and the correlation between…
We discuss some properties of the generalized entropies, called Renyi entropies and their application to the case of continuous distributions. In particular it is shown that these measures of complexity can be divergent, however, their…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
We study adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi $r$-uniform hypergraphs on $n$ vertices with hyperedge inclusion probability $p$, in the setting where $r$ can vary with $n$ such that $r / n \to c \in [0, 1)$. Adjacency…
We explore the spectra and localization properties of the N-site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory…
We study shallow and deep neural networks whose inputs range over a general topological space. The model is built from a prescribed family of continuous feature maps and reduces to multilayer feedforward networks in the Euclidean case. We…
The delay experienced by a probe due to interactions with a scattering media is highly related to the internal dynamics inside that media. This property is well captured by the Wigner delay time and the resonance widths. By the use of the…
We analyze the distribution of eigenvectors for mesoscopic, mean-field perturbations of diagonal matrices in the bulk of the spectrum. Our results apply to a generalized $N\times N$ Rosenzweig-Porter model. We prove that the eigenvectors…
We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erd\H{o}s-R\'enyi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the…