Metraipolis › archive › dc_beaff323612d

Concentration of Regularized Sparse Random Matrices: Spectral Edge Bounds via Nonbacktracking Operators — arXiv:2609.26615

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26615
License (as archived)
CC0-1.0
Archived
2026-10-08T15:54:02.986Z
SHA-256 of the archived text
880939ae7848d6ce2db846420e696c36a080675838d9bfde4f6658666f037c16
Stable URL of this page
https://metraipolis.com/documento/dc_beaff323612d

How to cite

Concentration of Regularized Sparse Random Matrices: Spectral Edge Bounds via Nonbacktracking Operators — arXiv:2609.26615 — arXiv (en), https://arxiv.org/abs/2609.26615 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_beaff323612d (Metraipolis archive dc_beaff323612d, sha256 880939ae7848d6ce2db846420e696c36a080675838d9bfde4f6658666f037c16)
BibTeX
@misc{dcbeaff323612d,
  title = {Concentration of Regularized Sparse Random Matrices: Spectral Edge Bounds via Nonbacktracking Operators — arXiv:2609.26615},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26615},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_beaff323612d; sha256 880939ae7848d6ce2db846420e696c36a080675838d9bfde4f6658666f037c16},
  year = {2026}
}

Archived text

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

In sparse random matrices, spectral outliers (eigenvalues and singular values located away from the bulk) emerge due to degree fluctuations: high degrees inflate the operator norm, while low column degrees reduce the least singular value. As proved by Feige and Ofek (2005) and Le, Levina, and Vershynin (2017), degree regularization enforces concentration at the expected norm scale. However, precise bounds incorporating the cutoffs remain unexplored and challenging since regularization introduces dependencies among entries. For the first time in the literature, we provide variance- and cutoff-dependent bounds for extreme singular values and eigenvalues of regularized inhomogeneous random matrices. In the absence of regularization, our lower bound for the least singular value matches the same leading constant obtained by Brailovskaya and van Handel (2024). Moreover, our error term vanishes under the milder condition $d/\log N\to\infty$, as opposed to their stronger requirement $d/(\log N)^4\to\infty$. A key ingredient is to extend spectral radius bounds for nonbacktracking matrices to the dependent setting. We build on approaches for independent cases established by Benaych-Georges, Bordenave, and Knowles (2020), as well as Dumitriu and Zhu (2024), and carefully handle edges traversed only once. Our proof framework separates deterministic spectral comparisons from probabilistic estimates: once Loewner inequalities and columnwise variance controls are established, the remaining probabilistic analysis boils down to verifying the graph moment conditions formulated in this paper. We hope this framework can be extended to handle general random matrices with more complex dependencies.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.ST).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO); Numerical Analysis (math.NA); Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.26615 — 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-08T15:12:57.883Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).