Results 31 to 40 of about 271,043 (253)

Stability Analysis Of The Rumor Spreading Model [PDF]

open access: yes, 2022
The process of spreading rumors is the same as the process of spreading infectious diseases. In this case, a rumor-spreading model is discussed in this study by considering the credibility of rumors, the correlation between rumors and lives, and the ...
Putri, Arrival Rince   +2 more
core   +1 more source

Randomized rumor spreading [PDF]

open access: yesProceedings 41st Annual Symposium on Foundations of Computer Science, 2002
Investigates the class of epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose n players communicate in parallel rounds in each of which every player calls a randomly selected communication ...
Richard M. Karp   +3 more
openaire   +4 more sources

Rumor Spreading with Bounded In-Degree [PDF]

open access: yesTheoretical Computer Science, 2016
In the classic gossip-based model of communication for disseminating information in a network, in each time unit, every node $u$ is allowed to contact a single random neighbor $v$. If $u$ knows the data (rumor) to be disseminated, it disperses it to $v$ (known as PUSH) and if it does not, it requests it from $v$ (known as PULL).
Sebastian Daum, Fabian Kuhn, Yannic Maus
openaire   +4 more sources

Rumor Spreading with No Dependence on Conductance [PDF]

open access: yesSIAM Journal on Computing, 2017
In this paper, we study how a collection of interconnected nodes can efficiently perform a global computation in the $\mathcal{GOSSIP}$ model of communication. In this model nodes do not know the global topology of the network and may only initiate contact with a single neighbor in each round.
Keren Censor-Hillel   +3 more
openaire   +3 more sources

Probabilistic Analysis of Rumor-Spreading Time [PDF]

open access: yesINFORMS Journal on Computing, 2020
The context of this work is the well-studied dissemination of information in large-scale distributed networks through pairwise interactions. This problem, originally called rumor mongering, and then rumor spreading, has mainly been investigated in the synchronous model.
Yves Mocquard   +2 more
openaire   +4 more sources

Rumor Situation Discrimination Based on Empirical Mode Decomposition Correlation Dimension

open access: yesComplexity, 2021
To effectively identify network rumors and block their spread, this paper uses fractal theory to analyze a network rumor spreading situation time series, reveal its inner regularity, extract features, and establish a network rumor recognition model.
Yanwen Xin, Fengming Liu
doaj   +1 more source

Dynamical Analysis of Hyper-ILSR Rumor Propagation Model with Saturation Incidence Rate

open access: yesEntropy, 2023
With the development of the Internet, it is more convenient for people to obtain information, which also facilitates the spread of rumors. It is imperative to study the mechanisms of rumor transmission to control the spread of rumors.
Xuehui Mei, Ziyu Zhang, Haijun Jiang
doaj   +1 more source

Modeling and Analysis of Rumor Control Strategies in Social Networks [PDF]

open access: yesComputer and Knowledge Engineering, 2022
Todays, although social networks are used for extensive information sharing, spreading rumors has also been accelerated and become a serious problem. Rumor control can be accomplished through either hard or soft control strategies.
Mojgan Askarizade   +2 more
doaj   +1 more source

A model to measure the spread power of rumors

open access: yesJournal of Ambient Intelligence and Humanized Computing, 2022
This is a preprint of an article published in "Journal of Ambient Intelligence and Humanized Computing"
Zoleikha Jahanbakhsh-Nagadeh   +9 more
openaire   +4 more sources

Asynchronous Rumor Spreading in Dynamic Graphs [PDF]

open access: yes, 2022
We study asynchronous rumor spreading algorithm in dynamic and static graphs. In the asynchronous rumor spreading, for a given underlying graph, each node is equipped with an exponential time clock of rate 1.
Mans, Bernard, Pourmiri, Ali
core   +1 more source

Home - About - Disclaimer - Privacy