Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers
Summary: Models polarization niches as dense subgraphs anchored by attractors A and repulsers R, using only network topology, no text mining. Proposes dith, a greedy upper-bound aware supermodular maximization with a stopping rule for scalable niches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,662 | On Density-based Local Community Search | 2024 | PODS | 5.628924e-05 |
| 9,551 | An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 5.316206e-05 |
| 10,072 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 5.1725247e-05 |
| 10,869 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 288 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022437469 |
| 6,727 | The Minimum Wiener Connector Problem | 2015 | SIGMOD | 5.847257e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,584 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB | 5.6478565e-05 |
| 4,045 | An efficient reconciliation algorithm for social networks | 2014 | VLDB | 7.0024323e-05 |
| 9,699 | Maximizing Fair Content Spread via Edge Suggestion in Social Networks | 2022 | VLDB | 5.2900821e-05 |
| 7,034 | Misinformation Mitigation under Differential Propagation Rates and Temporal Penalties | 2022 | VLDB | 5.7740266e-05 |
| 4,823 | Anchored Densest Subgraph | 2022 | SIGMOD | 6.5592921e-05 |
| 10,072 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 5.1725247e-05 |
| 9,259 | Densest Multipartite Subgraph Search in Heterogeneous Information Networks | 2024 | VLDB | 5.3572577e-05 |
| 6,006 | On A Quest for Combating Filter Bubbles and Misinformation | 2022 | SIGMOD | 6.071395e-05 |
| 10,246 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB | 5.1725247e-05 |
| 11,204 | Mitigating Filter Bubbles Under a Competitive Diffusion Model | 2023 | SIGMOD | 5.1725247e-05 |