The circular law for random regular digraphs with random edge weights

Authors

Publication date 22 September 2017

Abstract: We consider random

n i m e s n

matrices of the form

Y_{n} = f r a c 1 s q r t d A_{n} c i r c X_{n}

, where

A_{n}

is the adjacency matrix of a uniform random

d

-regular directed graph on

n

vertices, with

d = l f l o o r p n f l o o r

for some fixed

p i n (0, 1)

, and

X_{n}

is an

n i m e s n

matrix of iid centered random variables with unit variance and finite

4 + e t a

-th moment (here

c i r c

denotes the matrix Hadamard product). We show that as

n o i n f t y

, the empirical spectral distribution of

Y_{n}

converges weakly in probability to the normalized Lebesgue measure on the unit disk.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: The circular law for random regular digraphs with random edge weights