High-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 14-25
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Loose Hamilton Cycles in Random Uniform HypergraphsThe Electronic Journal of Combinatorics, 2011
- Dirac-type results for loose Hamilton cycles in uniform hypergraphsJournal of Combinatorial Theory, Series B, 2010
- Loose Hamilton Cycles in Random 3-Uniform HypergraphsThe Electronic Journal of Combinatorics, 2010
- The Diameter and Laplacian Eigenvalues of Directed GraphsThe Electronic Journal of Combinatorics, 2006
- Laplacians and the Cheeger Inequality for Directed GraphsAnnals of Combinatorics, 2005
- Spectral Graph Theory1996
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its LaplacianSIAM Journal on Discrete Mathematics, 1994
- The Laplacian of a hypergraph1993
- Quasi‐random hypergraphsRandom Structures & Algorithms, 1990
- Diameters and eigenvaluesJournal of the American Mathematical Society, 1989