Principal eigenvector and spectral radius of uniform hypergraphs
Haifeng Li, Jiang Zhou, Changjiang Bu
TL;DR
This paper establishes bounds on the principal eigenvector and spectral radius of connected uniform hypergraphs based on properties like vertex degrees, diameter, and size, enhancing understanding of their spectral characteristics.
Contribution
It provides new bounds for spectral properties of uniform hypergraphs relating to their structural parameters.
Findings
Bounds for spectral radius in terms of vertex degrees and diameter
Relations between principal eigenvector and hypergraph structure
Improved understanding of spectral properties of uniform hypergraphs
Abstract
In this paper, we give some bounds for principal eigenvector and spectral radius of connected uniform hypergraphs in terms of vertex degrees, the diameter, and the number of vertices and edges.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Graph theory and applications · Matrix Theory and Algorithms