Nonbacktracking spectral clustering of nonuniform hypergraphs

@article{Chodrow2022NonbacktrackingSC,
  title={Nonbacktracking spectral clustering of nonuniform hypergraphs},
  author={Philip S. Chodrow and Nicole Eikmeier and Jamie Haddock},
  journal={ArXiv},
  year={2022},
  volume={abs/2204.13586}
}
. Spectral methods offer a tractable, global framework for clustering in graphs via eigenvector computations on graph matrices. Hypergraph data, in which entities interact on edges of arbitrary size, poses challenges for matrix representations and therefore for spectral clustering. We study spectral clustering for nonuniform hypergraphs based on the hypergraph nonbacktracking operator. After reviewing the definition of this operator and its basic properties, we prove a theorem of Ihara-Bass type… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 62 REFERENCES
The physics of higher-order interactions in complex systems
TLDR
Evidence from neural systems shows that higher-order effects are present and important both statistically10–12 and topologically13,14, and there is also evidence to suggest that such higher- order signatures might in some cases be redundant.
Identifying critical higher-order interactions in complex networks
TLDR
Experimental results suggest that higher-order interactions play more critical roles than edges based on both the size of giant component and SIR, and the proposed methods are promising in identifying critical higher- order interactions.
What are higher-order networks?
TLDR
The goals of this survey article are to clarify what higher-order networks are, why these are interesting objects of study, and how they can be used in applications.
Belief propagation for networks with loops
TLDR
A novel belief propagation algorithm is derived for the solution of probabilistic models on networks containing short loops that allows for fast calculation of probability distributions in systems with short loops, potentially with high density, as well as giving expressions for the entropy and partition function, which are notoriously difficult quantities to compute.
Generative hypergraph clustering: From blockmodels to modularity
TLDR
This work proposes a probabilistic generative model of clustered hypergraphs with heterogeneous node degrees and edge sizes and derives an inference algorithm that generalizes the Louvain graph community detection method, and a faster, specialized variant in which edges are expected to lie fully within clusters.
Gendered Citation Practices in the Field of Communication
ABSTRACT In disciplines outside of communication, papers with women as first and last (i.e. senior) authors attract fewer citations than papers with men in those positions. Using data from 14
Normalized Laplace operators for hypergraphs with real coefficients
Chemical hypergraphs and their associated normalized Laplace operators are generalized and studied in the case where each vertex–hyperedge incidence has a real coefficient. We systematically study
...
...