RECORD
Distributed Rumor Blocking with Multiple Positive Cascades
Social and Information Networks · Submitted 20 Nov 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that the rumor blocking effect provided by the Nash equilibrium will not be arbitrarily worse even if the positive cascades are generated non-cooperatively.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is often assumed that there is a single authority whose goal is to minimize the spread of rumor by generating a positive cascade. In this paper, we study a more realistic scenario when there are multiple positive cascades generated by different agents. For the multiple-cascade diffusion, we propose the P2P independent cascade (PIC) model for private social communications. The main part of this paper is an analysis of the rumor blocking effect (i.e. the number of the users activated by rumor) when the agents non-cooperatively generate the positive cascades. We show that the rumor blocking effect provided by the Nash equilibrium will not be arbitrarily worse even if the positive cascades are generated non-cooperatively. In addition, we give a discussion on how the cascade priority and activation order affect the rumor blocking problem. We experimentally examine the Nash equilibrium of the proposed games by simulations done on real social network structures.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. | background 1.00 | 0.04 | 0.02 | asserted 0.99 |
| s1 | It is often assumed that there is a single authority whose goal is to minimize the spread of rumor by generating a positive cascade. | background 0.94 | 0.04 | 0.02 | asserted 0.79 |
| s2 | In this paper, we study a more realistic scenario when there are multiple positive cascades generated by different agents. | contribution 0.68 | 0.24 | 0.03 | asserted 0.93 |
| s3 | For the multiple-cascade diffusion, we propose the P2P independent cascade (PIC) model for private social communications. | method 0.92 | 0.90 | 0.03 | asserted 0.99 |
| s4 | The main part of this paper is an analysis of the rumor blocking effect (i.e. the number of the users activated by rumor) when the agents non-cooperatively generate the positive cascades. | contribution 0.97 | 0.76 | 0.09 | asserted 0.76 |
| s5 | We show that the rumor blocking effect provided by the Nash equilibrium will not be arbitrarily worse even if the positive cascades are generated non-cooperatively. | result 1.00 | 0.94 | 0.75 | asserted 1.00 |
| s6 | In addition, we give a discussion on how the cascade priority and activation order affect the rumor blocking problem. | contribution 0.96 | 0.83 | 0.03 | unclear 0.77 |
| s7 | We experimentally examine the Nash equilibrium of the proposed games by simulations done on real social network structures. | method 0.86 | 0.96 | 0.05 | asserted 0.98 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is often assumed that there is a single authority whose goal is to minimize the spread of rumor by generating a positive cascade. In this paper, we study a more realistic scenario when there are multiple positive cascades generated by different agents. For the multiple-cascade diffusion, we propose the P2P independent cascade (PIC) model for private social communications. The main part of this paper is an analysis of the rumor blocking effect (i.e. the number of the users activated by rumor) when the agents non-cooperatively generate the positive cascades. We show that the rumor blocking effect provided by the Nash equilibrium will not be arbitrarily worse even if the positive cascades are generated non-cooperatively. In addition, we give a discussion on how the cascade priority and activation order affect the rumor blocking problem. We experimentally examine the Nash equilibrium of the proposed games by simulations done on real social network structures.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.