On eigenvalue distribution of random matrices of Ihara zeta function of large random graphs

Abstract

We consider the ensemble of real symmetric random matrices H(n,) obtained from the determinant form of the Ihara zeta function of random graphs that have n vertices with the edge probability /n. We prove that the normalized eigenvalue counting function of H(n,) weakly converges in average as n,∞ and =o(nα) for any α>0 to a shift of the Wigner semi-circle distribution. Our results support a conjecture that the large Erdos-R\'enyi random graphs satisfy in average the weak graph theory Riemann Hypothesis.

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…