A Lovasz-Simonovits Theorem for Hypergraphs with Application to Local Clustering
Summary: Extends Lovasz-Simonovits theory to hypergraphs with an averaging diffusion operator, tying diffusion rate to conductance. Proposes APPRH and A-HyperCut via Forward Push, enabling faster clustering on large hypergraphs with stronger conductance guarantees. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Raj Kamal (Indian Institute of Technology Delhi)
- 2. Amitabha Bagchi (Indian Institute of Technology Delhi)
BibTeX Citation
@inproceedings{kamal_sigmod24,
title = {{A Lovasz-Simonovits Theorem for Hypergraphs with Application to Local Clustering}},
author = {Kamal, Raj and Bagchi, Amitabha},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3677126},
url = {https://dl.acm.org/doi/10.1145/3677126},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 556 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00016564032 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 2 | 1,396 | Estimating PageRank on Graph Streams | 2008 | PODS |
| 3 | 8,062 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD |
| 4 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 5 | 11,412 | Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation | 2023 | SIGMOD |
| 6 | 2,173 | Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push | 2021 | SIGMOD |
| 7 | 7,963 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD |
| 8 | 4,916 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB |
| 9 | 10,560 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB |
| 10 | 5,913 | Efficient Estimation of Heat Kernel PageRank for Local Clustering | 2019 | SIGMOD |