Spectral analysis of communication networks using Dirichlet eigenvalues
Proceedings of the 22nd international conference on World Wide Web
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
| Hi-index | 0.01 |
A model of regular infinite hypertrees is developed to mimic forhypergraphs what infinite trees do for graphs. Two notions of spectra,or “first eigenvalue,” are then examined for the infinitetree, obtaining a precise value for the first notion and obtaining someestimates for the second. The results indicate agreement of the firsteigenvalue of the infinite hypertree with the “secondeigenvalue” of a random hypergraph of the same degree, to withinlogarithmic factors, at least for the first notion of firsteigenvalue.—Author's Abstract