Non-backtracking Laplacian for hypergraphs
math.CO, math.SP
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- The non-backtracking random walk and its usage for vertex clustering
- Graphs are focal hypergraphs: strict containment in higher-order interaction dynamics
- Spectral community detection in sparse networks
- Non-backtracking Spectrum: Unitary Eigenvalues and Diagonalizability
- Geometric multiplicity of unitary non-backtracking eigenvalues
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality