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 (University of Victoria)
- 2. Venkatesh Srinivasan (University of Victoria)
- 3. Alex Thomo (University of Victoria)
BibTeX Citation
@article{howie_vldb23,
title = {{Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem}},
author = {Howie, Joseph and Srinivasan, Venkatesh and Thomo, Alex},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {11},
pages = {3165--3177},
doi = {10.14778/3611479.3611516},
url = {https://doi.org/10.14778/3611479.3611516},
year = {2023}
}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,049 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012415522 |
| 1,254 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.0001147266 |
| 2,977 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB | 7.9035901e-05 |
| 3,559 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 7.3095916e-05 |
| 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.7107949e-05 |
| 6,345 | Clustering Uncertain Graphs | 2018 | VLDB | 5.9059861e-05 |
| 7,963 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD | 5.5177915e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 2 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 3 | 3,559 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 4 | 6,345 | Clustering Uncertain Graphs | 2018 | VLDB |
| 5 | 364 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 6 | 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB |
| 7 | 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD |
| 8 | 3,511 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 9 | 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 10 | 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD |