
























The randomly oriented graph $G_{n,p}^σ$ is an Erdős-Rényi random graph $G_{n,p}$ with a random orientation $σ$, which assigns to each edge a direction so that $G_{n,p}^σ$ becomes a directed graph. Denote by $S_n$ the skew-adjacency matrix of $G_{n,p}^σ$. Under some mild assumptions, it is proved in this paper that, the spectral distribution of $S_n$ (under some normalization) converges to the standard semicircular law almost surely as $n\rightarrow\infty$. It is worth mentioning that our result does not require finite moments of the entries of the underlying random matrix.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。