Root-to-leaf path random walks on double covers of graded signed graphs normalize the Hodge Laplacian on simplicial complexes and yield Cheeger inequalities for the upper spectrum.
A Lower Bound for the Smallest Eigenvalue of the Laplacian
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial Complexes
Root-to-leaf path random walks on double covers of graded signed graphs normalize the Hodge Laplacian on simplicial complexes and yield Cheeger inequalities for the upper spectrum.