Results 11 to 20 of about 271,043 (253)

Rumor Spreading and Conductance [PDF]

open access: yesJournal of the ACM, 2018
In this article, we study the completion time of the PUSH-PULL variant of rumor spreading, also known as randomized broadcast. We show that if a network has n nodes and conductance ϕ then, with high probability, PUSH-PULL will deliver the message to all nodes in the graph within O (log
FLAVIO CHIERICHETTI   +3 more
openaire   +5 more sources

Quasirandom Rumor Spreading [PDF]

open access: yesACM Transactions on Algorithms, 2014
We propose and analyze a quasirandom analogue of the classical push model for disseminating information in networks (“randomized rumor spreading”). In the classical model, in each round, each informed vertex chooses a neighbor at random and informs it, if it was not informed before. It is known that this simple protocol succeeds in
Doerr, Benjamin   +2 more
openaire   +10 more sources

Adaptive Rumor Spreading [PDF]

open access: yes, 2015
Motivated by the recent emergence of the so-called opportunistic communication networks, we consider the issue of adaptivity in the most basic continuous time asynchronous rumor spreading process. In our setting a rumor has to be spread to a population; the service provider can push it at any time to any node in the network and has unit cost for doing ...
José Correa 0001   +3 more
openaire   +4 more sources

A Rumor-Spreading Model with Three Identical Time Delays

open access: yesMathematics
Understanding the effect of time delays on rumor spreading is of special importance to curbing the spread of rumors. This article proposes a rumor-spreading model with three identical time delays: a delay associated with the negative influence of a ...
Chunlong Fu   +4 more
doaj   +3 more sources

Modeling and Analysis of Rumor Spreading with Social Reinforcement Mechanism

open access: yesAdvances in Mathematical Physics, 2019
It is of great practical significance to figure out the propagation mechanism and outbreak condition of rumor spreading on online social networks. In our paper, we propose a multi-state reinforcement diffusion model for rumor spreading, in which the ...
Yuan Xu   +3 more
doaj   +2 more sources

Rumor spreading of a SEIR model in complex social networks with hesitating mechanism

open access: yesAdvances in Difference Equations, 2018
In the process of rumor spreading, controlling and killing rumor problem is of great importance on social networks. In this paper, we present a new SEIR (susceptible-exposed-infected-removed) rumor spreading model with hesitating mechanism. By using mean-
Xiongding Liu, Tao Li, Mi Tian
doaj   +2 more sources

Dynamical Model about Rumor Spreading with Medium [PDF]

open access: yesDiscrete Dynamics in Nature and Society, 2013
Rumor is a kind of social remark, that is untrue, and not be confirmed, and spreads on a large scale in a short time. Usually, it can induce a cloud of pressure, anxiety, and panic. Traditionally, it is propagated by word of mouth.
Xiaxia Zhao, Jianzhong Wang
doaj   +2 more sources

Stability Analysis of a Rumor-Spreading Model with Two Time Delays and Saturation Effect

open access: yesMathematics
Time delay and nonlinear incidence functions have a significant effect on rumor-spreading. In this article, a rumor-spreading model with two unequal time delays and a saturation effect is proposed.
Chunfeng Wei   +4 more
doaj   +3 more sources

Dynamic analysis and optimal control of a novel fractional-order 2I2SR rumor spreading model [PDF]

open access: yesNonlinear Analysis, 2023
In this paper, a novel fractional-order 2I2SR rumor spreading model is investigated. Firstly, the boundedness and uniqueness of solutions are proved. Then the next-generation matrix method is used to calculate the threshold.
Maolin Ye, Jiarong Li, Haijun Jiang
doaj   +2 more sources

Quasirandom rumor spreading [PDF]

open access: yesACM Journal of Experimental Algorithmics, 2008
We empirically analyze two versions of the well-known “randomized rumor spreading” protocol to disseminate a piece of information in networks. In the classical model, in each round, each informed node informs a random neighbor. In the recently proposed quasirandom variant, each node has a (cyclic) list of its neighbors.
Doerr, B.   +3 more
openaire   +8 more sources

Home - About - Disclaimer - Privacy