arXiv (All)
open access
Non-backtracking eigenvalues and eigenvectors of random regular graphs and hypergraphs
The non-backtracking operator of a graph is a powerful tool in spectral graph theory and random matrix theory. Most existing results for the non-backtracking operator of a random graph concern only eigenvalues or top eigenvectors. In this paper, we take the first step in analyzing its bulk eigenvect
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Canonization of a random graph by two matrix-vector multiplications#651997
- Canonization of a random graph by two matrix-vector multiplications#650544
- Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra#996996
- Discrete eigenvalue optimization from entropic smoothing and first-order methods#820645
- Localization Lengths for Two-Dimensional Random Band Matrices: Stretched-Exponential Lower Bounds#1050603
Record · ID 1105889
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive