相关论文: Multifractal phase in the weighted adjacency matri…
We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, 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…
We analyse the eigenvectors of the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathbb G(N,d/N)$ for $\sqrt{\log N} \ll d \lesssim \log N$. We show the existence of a localized phase, where each eigenvector is exponentially localized…
In this work we study the spectral properties of the adjacency matrix of critical Erd\"os-R\'enyi (ER) graphs, i.e. when the average degree is of order \log N. In a series of recent inspiring papers Alt, Ducatez, and Knowles have rigorously…
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…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…
We analyse the eigenvectors of the adjacency matrix of a critical Erd\H{o}s-R\'enyi graph $\mathbb G(N,d/N)$, where $d$ is of order $\log N$. We show that its spectrum splits into two phases: a delocalized phase in the middle of the…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…
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…
We study the near-critical behavior of the sparse Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$ on $n\gg1$ vertices, where the connection probability $p$ satisfies $np = 1+\theta(b_n^2/n)^{1/3}$, with $n^{3/10}\ll {b_n}\ll n^{1/2}$, and…
We analyse the eigenvectors of the adjacency matrix of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $\frac{d}{N}$. We determine the full region of delocalization by determining the critical values of $\frac{d}{\log N}$…
We present results on the concentration properties of the spectral norm $\|A_p\|$ of the adjacency matrix $A_p$ of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. First we consider the Erd\H{o}s-R\'enyi random graph process and prove that…
The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random…
In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…
We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the…
Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one…