The Spectra of Infinite Hypertrees
- 1 October 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (5) , 951-961
- https://doi.org/10.1137/0220058
Abstract
A model of regular infinite hypertrees is developed to mimic for hypergraphs what infinite trees do for graphs. Two notions of spectra, or “first eigenvalue,” are then examined for the infinite tree, obtaining a precise value for the first notion and obtaining some estimates for the second. The results indicate agreement of the first eigenvalue of the infinite hypertree with the ”second eigenvalue“ of a random hypergraph of the same degree, to within logarithmic factors, at least for the first notion of first eigenvalue.Keywords
This publication has 5 references indexed in Scilit:
- On the second eigenvalue and random walks in randomd-regular graphsCombinatorica, 1991
- Diameters and eigenvaluesJournal of the American Mathematical Society, 1989
- Ramanujan graphsCombinatorica, 1988
- Spectral and function theory for combinatorial LaplaciansContemporary Mathematics, 1988
- Algebraic GeometryPublished by Springer Nature ,1977