Spheres of Influence for More Effective Viral Marketing
Summary: Defines sphere of influence under probabilistic contagion and the Typical Cascade problem: minimize expected Jaccard distance to cascades from s. Proposes sampling-based Jaccard Median, an index to compute spheres efficiently, and a set-cover view of influence maximization with empirical gains over greedy. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yasir Mehmood (Pompeu Fabra University)
- 2. Francesco Bonchi (Institute for Scientific Interchange)
- 3. David García-Soriano (Eurecat)
BibTeX Citation
@inproceedings{mehmood_sigmod16,
title = {{Spheres of Influence for More Effective Viral Marketing}},
author = {Mehmood, Yasir and Bonchi, Francesco and García-Soriano, David},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2915250},
url = {https://dl.acm.org/doi/10.1145/2882903.2915250},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 6.1751704e-05 |
| 7,771 | Triangular Stability Maximization by Influence Spread over Social Networks | 2023 | VLDB | 5.5470467e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043596705 |
| 194 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.000259047 |
| 296 | A Data-Based Approach to Social Influence Maximization | 2012 | VLDB | 0.00022220351 |
| 947 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00013041389 |
| 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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,858 | Maximizing Welfare in Social Networks under A Utility Driven Influence Diffusion model | 2019 | SIGMOD |
| 2 | 315 | Influence Maximization in Near-Linear Time: A Martingale Approach | 2015 | SIGMOD |
| 3 | 8,595 | Maximizing Social Welfare in a Competitive Diffusion Model | 2021 | VLDB |
| 4 | 2,547 | From Competition to Complementarity: Comparative Influence Diffusion and Maximization | 2016 | VLDB |
| 5 | 7,963 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD |
| 6 | 11,216 | Influence Maximization via Vertex Countering | 2024 | VLDB |
| 7 | 8,795 | Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks | 2018 | SIGMOD |
| 8 | 2,320 | Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 2020 | SIGMOD |
| 9 | 194 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD |
| 10 | 7,315 | Analysis of Influence Contribution in Social Advertising | 2022 | VLDB |