Metraipolis › archive › dc_dda1ee3fa354
The real eigenvalues of the non-backtracking Laplacian — arXiv:2611.02194
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02194
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:50:35.161Z
- SHA-256 of the archived text
44c3a209b284797fc51b4e6bb145ec9eaf9c8be8e2767a879473d87f9f3d4d3d- Stable URL of this page
https://metraipolis.com/documento/dc_dda1ee3fa354
How to cite
The real eigenvalues of the non-backtracking Laplacian — arXiv:2611.02194 — arXiv (en), https://arxiv.org/abs/2611.02194 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dda1ee3fa354 (Metraipolis archive dc_dda1ee3fa354, sha256 44c3a209b284797fc51b4e6bb145ec9eaf9c8be8e2767a879473d87f9f3d4d3d)
BibTeX
@misc{dcdda1ee3fa354,
title = {The real eigenvalues of the non-backtracking Laplacian — arXiv:2611.02194},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02194},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dda1ee3fa354; sha256 44c3a209b284797fc51b4e6bb145ec9eaf9c8be8e2767a879473d87f9f3d4d3d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02194. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a simple graph on $N$ nodes and $M$ edges, with minimum degree at least $2$. We prove that the non-backtracking Laplacian of $G$ has at least $2M-2N+2c+2b$ real eigenvalues, counted with algebraic multiplicity, where $c$ is the number of connected components of $G$ and $b$ is the number of bipartite ones. More precisely, at least $M-N+2c$ of them lie in $[0,1)$ and at least $M-N+2b$ lie in $(1,2]$. We show that the bound $2M-2N+2c+2b$ is sharp, and that a connected $d$-regular graph attains it if and only if it is strictly Ramanujan, i.e., every adjacency eigenvalue $\mu\ne\pm d$ satisfies $|\mu|<2\sqrt{d-1}$. For completeness, we also show that the non-backtracking Laplacian has at most $2M-2c-2b$ real eigenvalues.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Spectral Theory (math.SP).
Pagina del lavoro: https://arxiv.org/abs/2611.02194 — 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-11-03T18:15:38.091Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).