Loose laplacian spectra of random hypergraphs
β Scribed by Linyuan Lu; Xing Peng
- Book ID
- 112187421
- Publisher
- John Wiley and Sons
- Year
- 2012
- Tongue
- English
- Weight
- 230 KB
- Volume
- 41
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let K (k) (n, p) be the random k-uniform hypergraph obtained by independent inclusion of each of the ( n k ) k-tuples with probability p. For an arbitrary k-uniform hypergraph G and every integer r we find the threshold for the property that every r-coloring of the vertices of K (k) (n, p) results i
To a regular hypergraph we attach an operator, called its adjacency matrix, and study the second largest eigenvalue as well as the overall distribution of the spectrum of this operator. Our definition and results extend naturally what is known for graphs, including the analogous threshold bound 2 -k