Results 31 to 40 of about 1,337,924 (288)
Rumor Situation Discrimination Based on Empirical Mode Decomposition Correlation Dimension
Complexity, 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
Modeling and Analysis of Rumor Control Strategies in Social Networks [PDF]
Computer 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
Mathematics, 2022 The propagation of rumors on online social networks (OSNs) brings an awful lot of trouble to people’s life and society. Aiming at combating rumors spreading on OSNs, two novel rumor-propagation models without and with time delays are proposed, which ...
Shuzhen Yu, Zhiyong Yu, Haijun Jiang
semanticscholar +1 more source
Dynamics of 2SIH2R Rumor-Spreading Model in a Heterogeneous Network
Wireless Communications and Mobile Computing, 2022 Due to the development of social media, the threshold for information dissemination has become lower than ever before. As a special kind of information, rumors are usually harmful and are usually accompanied by a high degree of ambiguity that makes them ...
Yan Wang, Feng Qing, Ming Yan
semanticscholar +1 more source
Finding Rumor Sources on Random Trees [PDF]
, 2015 We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to \emph{when} these nodes became infected.
Shah, Devavrat, Zaman, Tauhid
core +2 more sources
Rumor Spreading with Bounded In-Degree [PDF]
Theoretical 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).
Daum, Sebastian +2 more
openaire +3 more sources
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading [PDF]
, 2014 We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network, and every node is only allowed to call one neighbor in each round.
Guo, Zeyu, Sun, He
core +3 more sources
Immunization against the Spread of Rumors in Homogenous Networks. [PDF]
PLoS ONE, 2015 Since most rumors are harmful, how to control the spread of such rumors is important. In this paper, we studied the process of "immunization" against rumors by modeling the process of rumor spreading and changing the termination mechanism for the spread ...
Laijun Zhao, Jiajia Wang, Rongbing Huang
doaj +1 more source
Modeling and Analysis of Rumor Spreading with Social Reinforcement Mechanism
Advances 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 +1 more source
A process of rumor scotching on finite populations [PDF]
, 2015 Rumor spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumor is propagated by pairwise interactions between spreaders and ignorants.
de Arruda, Guilherme Ferraz +3 more
core +2 more sources