Related papers: Moment-Based Spectral Analysis of Random Graphs wi…
Inspired by applications to theories of coding and communication in networks of nervous tissue, we study maximum entropy distributions on weighted graphs with a given expected degree sequence. These distributions are characterized by…
We consider powers of random matrices with independent entries. Let $X_{ij}, i,j\ge 1$, be independent complex random variables with $\E X_{ij}=0$ and $\E |X_{ij}|^2=1$ and let $\mathbf X$ denote an $n\times n$ matrix with $[\mathbf…
The projected normal distribution, also known as the angular Gaussian distribution, is obtained by dividing a multivariate normal random variable $\mathbf{x}$ by its norm $\sqrt{\mathbf{x}^T \mathbf{x}}$. The resulting random variable…
We study the eigenvector mass distribution of an $N\times N$ Wigner matrix on a set of coordinates $I$ satisfying $| I | \ge c N$ for some constant $c >0$. For eigenvectors corresponding to eigenvalues at the spectral edge, we show that the…
This paper investigates the limiting behaviour of degree-degree correlation metrics for sequences of random graphs under a general assumption of local convergence in probability. We establish convergence results for Pearson's correlation…
In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to…
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
We consider Markovian dynamics on a typical realization of the so-called Directed Configuration Model (DCM), that is, a random directed graph with prescribed in- and out-degrees. In this random geometry, we study the meeting time of two…
In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…
Let $G$ be an irregular graph on $n$ vertices with maximum degree $\Delta$ and diameter $D$. We show that \Delta-\lambda_1>\frac{1}{nD} where $\lambda_1$ is the largest eigenvalue of the adjacency matrix of $G$. We also study the effect of…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
This paper is devoted to the distribution of the eigenvalues of $XUYU^t$ where $X$ and $Y$ are given symmetric matrices and $U$ is a random real valued square matrix of standard normal distribution. More specifically we look at its moments,…
We consider the ensemble of $N\times N$ real random symmetric matrices $H_N^{(R)}$ obtained from the determinant form of the Ihara zeta function associated to random graphs $\Gamma_N^{(R)}$ of the long-range percolation radius model with…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
The properties of eigenvalues of large dimensional random matrices have received considerable attention. One important achievement is the existence and identification of the limiting spectral distribution of the empirical spectral…
We present a detailed study of the phase diagram of the Ising model in random graphs with arbitrary degree distribution. By using the replica method we compute exactly the value of the critical temperature and the associated critical…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eigenvalues typically…