The circular law for random regular digraphs with random edge weights

Abstract

We consider random n× n matrices of the form Yn=1dAn Xn, where An is the adjacency matrix of a uniform random d-regular directed graph on n vertices, with d= p n for some fixed p ∈ (0,1), and Xn is an n× n matrix of iid centered random variables with unit variance and finite 4+η-th moment (here denotes the matrix Hadamard product). We show that as n ∞, the empirical spectral distribution of Yn converges weakly in probability to the normalized Lebesgue measure on the unit disk.

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…