Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem
Summary: Recasts expected Jaccard similarity in probabilistic-graph structural clustering as a one-tailed Normal CDF via a Lyapunov CLT-based construction of random variables. Achieves linear runtime (vs prior quadratic DP), enabling web-scale clustering of massive graphs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Joseph Howie
- 2. Venkatesh Srinivasan
- 3. Alex Thomo
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 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 1,450 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011925844 |
| 3,101 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB | 7.5598015e-05 |
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |
| 4,657 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0187213e-05 |
| 6,545 | Clustering Uncertain Graphs | 2018 | VLDB | 5.0193115e-05 |
| 7,904 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD | 4.6214923e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,048 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 4.1945683e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |
| 6,545 | Clustering Uncertain Graphs | 2018 | VLDB | 5.0193115e-05 |
| 313 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00028097557 |
| 6,989 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8716197e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 2,542 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB | 8.5794502e-05 |
| 2,436 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8252104e-05 |
| 4,657 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0187213e-05 |