Answers are grounded in this paper and cite their sources.
Hypergraphs have been attracting more attention because they are suitable for representing real-world networks with complex relations of three or more terms. Clustering hypergraphs is a fundamental task in network analysis. Although several algorithms for finding a community with a theoretical guarantee are already known, almost all require information on the entire hypergraph for calculation. In this study, we propose a personalized PageRank random walk on a hypergraph and an algorithm for hypergraphs to extract a local community, which can be calculated purely locally. We experimentally show that the algorithm outperforms a benchmark method for real-world hypergraphs. We also evaluate the matching rates with the local community and weak ties using F1-scores while varying several parameters for a synthetic hypergraph generated by a stochastic block model.
No takes yet. Share an insight, caveat, or question.
Oka et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: