The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Threshold Models for Competitive 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
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Social Ties and Word-of-Mouth Referral Behavior
Brown, J. J., & Reingen, P. H. (1987) · Journal of Consumer Research · doi:10.1086/209118 · Cited by 2,378
Word of Mouth: Rumor Dissemination in Social Networks
Kostka, J., Oswald, Y. A., & Wattenhofer, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69355-0_16 · Cited by 198
Cited by
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
Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model
He, X., Song, G., Chen, W., & Jiang, Q. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.40 · Cited by 403
Information and Influence Propagation in Social Networks
Chen, W., Lakshmanan, L. V. S., & Castillo, C. (2013) · Synthesis lectures on data management · doi:10.2200/s00527ed1v01y201308dtm037 · Cited by 254
Quantifying echo chamber effects in information spreading over political communication networks
Cota, W., Ferreira, S. C., Pastor-Satorras, R., & Starnini, M. (2019) · EPJ Data Science · doi:10.1140/epjds/s13688-019-0213-9 · Cited by 146
Metadata
- Authors
- Borodin, A., Filmus, Y., & Oren, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 539-550
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1502487903
- Cited by
- 306
- References
- 5
- FWCI
- 9.80
- 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: Threshold Models for Competitive Influence in Social Networks. https://app.cochat.ai/papers/10.1007/978-3-642-17572-5_48
- The paper
- Borodin, A., Filmus, Y., & Oren, J. (2010). Threshold Models for Competitive Influence in Social Networks. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-17572-5_48
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.