The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the submodularity of influence in social networks
Abstract
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Cited by
Efficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
Structural diversity in social contagion
Ugander, J., Backstrom, L., Marlow, C., & Kleinberg, J. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1116502109 · Cited by 695
Influence Maximization on Social Graphs: A Survey
Li, Y., Fan, J., Wang, Y., & Tan, K.-L. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807843 · Cited by 659
A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
Narayanam, R., & Narahari, Y. (2011) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2010.2052042 · Cited by 382
The convergence of social and technological networks
Kleinberg, J. (2008) · Communications of the ACM · doi:10.1145/1400214.1400232 · Cited by 346
Metadata
- Authors
- Mossel, E., & Roch, S.
- Venue
- Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2007-06-11
- Pages
- 128-134
- OpenAlex
- W2003827431
- Cited by
- 217
- References
- 1
- FWCI
- 14.38
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the submodularity of influence in social networks. https://app.cochat.ai/papers/10.1145/1250790.1250811
- The paper
- Mossel, E., & Roch, S. (2007). On the submodularity of influence in social networks. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1250790.1250811
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.