Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The circular law for random regular digraphs with random edge weights (1508.00208v3)

Published 2 Aug 2015 in math.PR

Abstract: We consider random $n\times n$ matrices of the form $Y_n=\frac1{\sqrt{d}}A_n\circ X_n$, where $A_n$ is the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices, with $d=\lfloor p n\rfloor$ for some fixed $p \in (0,1)$, and $X_n$ is an $n\times n$ matrix of iid centered random variables with unit variance and finite $4+\eta$-th moment (here $\circ$ denotes the matrix Hadamard product). We show that as $n\to \infty$, the empirical spectral distribution of $Y_n$ converges weakly in probability to the normalized Lebesgue measure on the unit disk.

Summary

We haven't generated a summary for this paper yet.