Local community detection by random walk on hypergraphs

DOI10.1080/03610926.2025.2525358MaRDI QIDQ6862268zbMATH OpenFDO

Authors Naoki Matsumoto, Yuuki Takai, Masahiro Ikeda

Publication date 9 February 2026

Published in Communications in Statistics. Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2025.2525358

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
• A survey on theoretical advances of community detection in networks
• Approximating the expansion profile and almost optimal local graph clustering
• Cheeger inequalities for submodular transformations
• Community structure in social and biological networks
• Eigenvalues and expanders
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm
• Finding Cheeger cuts in hypergraphs via heat equation
• Finding sparse cuts locally using evolving sets
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
• Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
• Local partitioning for directed graphs using pagerank
• Shifted power method for computing tensor eigenpairs
• Tight bounds for the cover time of multiple random walks
• Using PageRank to Locally Partition a Graph

This page was built for publication: Local community detection by random walk on hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862268)