Spectra of Adjacency and Laplacian Matrices of Inhomogeneous Erdos-R\'enyi Random Graphs

Abstract

Inhomogeneous Erdos-R\'enyi random graphs GN on N vertices in the non-dense regime are considered in this paper. The edge between the pair of vertices \i,j\ is retained with probability N\,f(iN,jN), 1 ≤ i ≠ j ≤ N, independently of other edges, where f\,[0,1] × [0,1] [0,∞) is a continuous function such that f(x,y)=f(y,x) for all x,y ∈ [0,1]. We study the empirical distribution of both the adjacency matrix AN and the Laplacian matrix N associated with GN in the limit as N ∞ when N∞ N = 0 and N∞ NN = ∞. In particular, it is shown that the empirical spectral distributions of AN and N, after appropriate scaling and centering, converge to deterministic limits weakly in probability. For the special case where f(x,y) = r(x)r(y) with r\,[0,1] [0,∞) a continuous function, we give an explicit characterization of the limiting distributions. Furthermore, applications of the results to constrained random graphs, Chung-Lu random graphs and social networks are shown.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…