Metraipolis › archive › dc_508be2550512

The singularity probability of dense random regular graphs — arXiv:2610.09380

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09380
License (as archived)
CC0-1.0
Archived
2026-10-08T12:43:07.137Z
SHA-256 of the archived text
a699b2cbe406f9e4256216e550a4b50a9beab9db7c149d54eb56d9a700e59d0a
Stable URL of this page
https://metraipolis.com/documento/dc_508be2550512

How to cite

The singularity probability of dense random regular graphs — arXiv:2610.09380 — arXiv (en), https://arxiv.org/abs/2610.09380 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_508be2550512 (Metraipolis archive dc_508be2550512, sha256 a699b2cbe406f9e4256216e550a4b50a9beab9db7c149d54eb56d9a700e59d0a)
BibTeX
@misc{dc508be2550512,
  title = {The singularity probability of dense random regular graphs — arXiv:2610.09380},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09380},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_508be2550512; sha256 a699b2cbe406f9e4256216e550a4b50a9beab9db7c149d54eb56d9a700e59d0a},
  year = {2026}
}

Archived text

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

Let $G_{n,d}$ be a uniformly random simple $d$-regular graph on $n$ vertices, and let $A_n$ be its adjacency matrix. For every fixed $\lambda\in(0,1/2)$, we prove that for any $\lambda(n-1)\le d\le(1-\lambda)(n-1)$, $\mathbb P(A_n\text{ is singular})\le e^{-cn}$, where $c>0$ depends only on $\lambda$, and $n$ is sufficiently large with $nd$ even.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.09380 — 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-08T12:16:30.195Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).