Adjacency spectra of random and complete hypergraphs
From MaRDI portal
Abstract: We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra to that of the all-ones hypermatrix. Several of the ingredients along a possible path to this conjecture are established, and may be of independent interest in spectral hypergraph/hypermatrix theory. In particular, we provide a bound on the spectral radius of the symmetric Bernoulli hyperensemble, and show that the spectrum of the complete (k)-uniform hypergraph for (k=2,3) is close to that of an appropriately scaled all-ones hypermatrix.
Recommendations
- Spectra of random regular hypergraphs
- Loose Laplacian spectra of random hypergraphs
- On the spectra of general random graphs
- Spectra of hypergraphs and applications
- On the adjacency spectra of hypertrees
- scientific article; zbMATH DE number 3745227
- On the structure of random hypergraphs
- On the spectrum of hypergraphs
- scientific article; zbMATH DE number 6902684
- The graph spectra and spectral moments of random graphs
Cites work
- scientific article; zbMATH DE number 7273682 (Why is no real title available?)
- scientific article; zbMATH DE number 6026126 (Why is no real title available?)
- A general product of tensors with applications
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A spectral theory for tensors
- A survey on the spectral theory of nonnegative tensors.
- Algebraic connectivity of an even uniform hypergraph
- Analytic methods for uniform hypergraphs
- Bounds for the greatest eigenvalue of positive tensors
- Computing hypermatrix spectra with the Poisson product formula
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Discriminants, resultants, and multidimensional determinants
- Eigenvalues and linear quasirandom hypergraphs
- Eigenvalues of a real supersymmetric tensor
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
- Further results for Perron-Frobenius theorem for nonnegative tensors
- High-order random walks and generalized Laplacians on hypergraphs
- Homotopies for solving polynomial systems within a bounded domain
- Laplacian eigenvalues and partition problems in hypergraphs
- Loose Laplacian spectra of random hypergraphs
- On eigenvalue problems of real symmetric tensors
- On perturbation of roots of homogeneous algebraic systems
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- On the Laplacian Spectrum and Walk-regular Hypergraphs
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
- On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
- On the largest eigenvalue of a symmetric nonnegative tensor.
- On the second eigenvalue of hypergraphs
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Perturbation theory for linear operators.
- Quasianalytic multiparameter perturbation of polynomials and normal matrices
- Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Some Ramanujan hypergraphs associated to GL\((n,\mathbb{F}_q)\)
- Spectra of hypergraphs and applications
- Spectra of uniform hypergraphs
- Spectral extremal problems for hypergraphs
- The eigenvalues of random symmetric matrices
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- The inverse, rank and product of tensors
- The number of eigenvalues of a tensor
- The poset of hypergraph quasirandomness
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
Cited in
(10)- Spectra of uniform hypergraphs
- Adjacency spectrum of complete 4-uniform hypergraph.
- Melonic dominance and the largest eigenvalue of a large random tensor
- Spectra of random regular hypergraphs
- Limit points of spectra for first-order properties of random hypergraphs
- Circulant association schemes on triples
- Loose Laplacian spectra of random hypergraphs
- The characteristic polynomial of the complete 3-uniform hypergraph
- Sparse random hypergraphs: non-backtracking spectra and community detection
- Computing hypermatrix spectra with the Poisson product formula
This page was built for publication: Adjacency spectra of random and complete hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309685)
