Analytic Connectivity in General Hypergraphs
Ashwin Guha, Muni Sreenivas Pydi, Biswajit Paria, Ambedkar, Dukkipati
TL;DR
This paper extends the concept of analytic connectivity to non-uniform hypergraphs, providing new theoretical bounds and inequalities that relate connectivity to hypergraph properties.
Contribution
It introduces a modified Cheeger's inequality and bounds on analytic connectivity for non-uniform hypergraphs, advancing theoretical understanding.
Findings
Proved a modified Cheeger's inequality for hypergraphs.
Established bounds on analytic connectivity based on degree sequence and diameter.
Extended analytic connectivity results to non-uniform hypergraphs.
Abstract
In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a hypergraph.
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
TopicsGraph theory and applications · Tensor decomposition and applications · Advanced Graph Theory Research