Metraipolis › archive › dc_8bbd5899cd20

Bernoulli flow for Erdős-Rényi graphs — arXiv:2609.15566

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15566
License (as archived)
CC0-1.0
Archived
2026-10-16T01:19:01.376Z
SHA-256 of the archived text
41fbdb02c0abef45e2c056ec7ead8e725a74fbb3814edd71c22c1175feb20e56
Stable URL of this page
https://metraipolis.com/documento/dc_8bbd5899cd20

How to cite

Bernoulli flow for Erdős-Rényi graphs — arXiv:2609.15566 — arXiv (en), https://arxiv.org/abs/2609.15566 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8bbd5899cd20 (Metraipolis archive dc_8bbd5899cd20, sha256 41fbdb02c0abef45e2c056ec7ead8e725a74fbb3814edd71c22c1175feb20e56)
BibTeX
@misc{dc8bbd5899cd20,
  title = {Bernoulli flow for Erdős-Rényi graphs — arXiv:2609.15566},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15566},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8bbd5899cd20; sha256 41fbdb02c0abef45e2c056ec7ead8e725a74fbb3814edd71c22c1175feb20e56},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15566. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the eigenvalues and eigenvectors of the adjacency matrix $A$ of the Erdős-Rényi graph $\mathbb G(N,p)$ in the regime $Np \gg (\log N)^2$. We establish optimal isotropic delocalization for the bulk eigenvectors $\boldsymbol u$, meaning that $\langle \boldsymbol v, \boldsymbol u\rangle^2 \leq \frac{C \log N}{N}$ with very high probability for any deterministic normalized $\boldsymbol v$. In addition, we prove local spectral universality in the bulk by showing that the local spectral statistics coincide with those of the GOE. The main tool of our proof is a local law for the resolvent of $A$, down to optimal spectral scales and with optimal error bounds. Its proof relies on a new approach to local laws that we call the Bernoulli flow. It is a characteristic flow method in which the usual Brownian process is replaced by a Bernoulli process, where each edge of the graph forms an independent Markov process that jumps at unit rate from closed to open. The spectral parameter flows according to a suitably constructed matrix-valued Bernoulli characteristic flow.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.PR).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.15566 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:31:28.450Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).