HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering. (arXiv:2210.14813v1 [cs.LG])

This paper introduces a scalable algorithmic framework (HyperEF) for spectral
coarsening (decomposition) of large-scale hypergraphs by exploiting hyperedge
effective resistances. Motivated by the latest theoretical framework for
low-resistance-diameter decomposition of simple graphs, HyperEF aims at
decomposing large hypergraphs into multiple node clusters with only a few
inter-cluster hyperedges. The key component in HyperEF is a nearly-linear time
algorithm for estimating hyperedge effective resistances, which allows
incorporating the latest diffusion-based non-linear quadratic operators defined
on hypergraphs. To achieve good runtime scalability, …

arxiv clustering hypergraph