Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers
Summary: Models polarization niches as dense subgraphs attracted to misinformation sources and repelled by authoritative ones, using only network structure. The DITH supermodular-greedy algorithm offers user-specified approximation guarantees with scalable early termination. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Adriano Fazzone (CENTAI Institute)
- 2. Tommaso Lanciano (Sapienza University)
- 3. Riccardo Denni (Sapienza University)
- 4. Charalampos E. Tsourakakis (Boston University; ISI Foundation)
- 5. Francesco Bonchi (CENTAI Institute; Eurecat)
BibTeX Citation
@article{fazzone_vldb22,
title = {{Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers}},
author = {Fazzone, Adriano and Lanciano, Tommaso and Denni, Riccardo and Tsourakakis, Charalampos E. and Bonchi, Francesco},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {13},
pages = {3883--3896},
doi = {10.14778/3565838.3565843},
url = {https://doi.org/10.14778/3565838.3565843},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,409 | On Density-based Local Community Search | 2024 | PODS | 5.8841661e-05 |
| 9,553 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 5.2528121e-05 |
| 9,696 | An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 5.2351259e-05 |
| 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022620623 |
| 6,125 | The Minimum Wiener Connector Problem | 2015 | SIGMOD | 5.9675732e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,094 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB |
| 2 | 3,358 | An efficient reconciliation algorithm for social networks | 2014 | VLDB |
| 3 | 9,848 | Maximizing Fair Content Spread via Edge Suggestion in Social Networks | 2022 | VLDB |
| 4 | 7,157 | Misinformation Mitigation under Differential Propagation Rates and Temporal Penalties | 2022 | VLDB |
| 5 | 4,554 | Anchored Densest Subgraph | 2022 | SIGMOD |
| 6 | 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 7 | 8,396 | Densest Multipartite Subgraph Search in Heterogeneous Information Networks | 2024 | VLDB |
| 8 | 5,665 | On A Quest for Combating Filter Bubbles and Misinformation | 2022 | SIGMOD |
| 9 | 10,534 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB |
| 10 | 11,403 | Mitigating Filter Bubbles Under a Competitive Diffusion Model | 2023 | SIGMOD |