Related papers: Local Kesten--McKay law for random regular graphs

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…

Let $G=G(n,m)$ be a random graph whose average degree $d=2m/n$ is below the $k$-colorability threshold. If we sample a $k$-coloring $\sigma$ of $G$ uniformly at random, what can we say about the correlations between the colors assigned to…

Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…

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 this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our…

We study Dyson Brownian motion with general potential $V$ and for general $\beta \geq 1$. For short times $t = o (1)$ and under suitable conditions on $V$ we obtain a local law and corresponding rigidity estimates on the particle locations;…

These notes provide an introduction to the local semicircle law from random matrix theory, as well as some of its applications. We focus on Wigner matrices, Hermitian random matrices with independent upper-triangular entries with zero…

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…

We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…

We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms of absorption times of random walks from other vertices to the vertex…

In this paper, we consider the soft geometric block model (SGBM) with a fixed number $k \geq 2$ of homogeneous communities in the dense regime, and we introduce a spectral clustering algorithm for community recovery on graphs generated by…

In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels…

Consider the random matrix obtained from the adjacency matrix of a random d-regular graph by multiplying every entry by a random sign. The largest eigenvalue converges, after proper scaling, to the Tracy--Widom distribution.

The Green functions play a big role in the calculation of the local density of states of the carbon nanostructures. We investigate their nature for the variously oriented and disclinated graphene-like surface. Next, we investigate the case…

We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish 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…

The accuracy of the forward scattering approximation for two-point Green's functions of the Anderson localization model on the Cayley tree is studied. A relationship between the moments of the Green's function and the largest eigenvalue of…

Applying Stein's method, an inductive technique and size bias coupling yields a Berry-Esseen theorem for normal approximation without the usual restriction that the coupling be bounded. The theorem is applied to counting the number of…

Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…