Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum
Summary: Density decomposition is cast as a Fisher market (edges as buyers, nodes as sellers) using proportional-response updates that converge to equilibrium. A novel exponential momentum (geometric interpolation) accelerates these gradient-like steps, yielding orders-of-magnitude speedups on large graphs for downstream graph-mining tasks. (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. Quan Xue
- 2. T-H. Hubert Chan
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 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065491112 |
| 279 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00029113513 |
| 396 | One Trillion Edges: Graph Processing at Facebook-Scale | 2015 | VLDB | 0.00024424102 |
| 1,029 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00014582849 |
| 1,570 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011322927 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 3,575 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 6.9528126e-05 |
| 4,145 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4122551e-05 |
| 4,344 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 6.2744553e-05 |
Previous
Page 1 / 1
Next