Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a
network's most influential nodes, but are rarely usefully accurate in quantifying the spreading …

Objectives This paper investigates the role of epistemic belief in affecting Internet users'
decision to share online health rumors. To delve deeper, it examines how the characteristics …

In the “Age of the Internet”, fake news and rumor-mongering have emerged as some of the
most critical factors that affect our online social lives. For example, in the workplace, rumor …

With the rapid development of information networks, negative impacts of rumor propagation
become more serious. Nowadays, knowing the mechanisms of rumor propagation and …

Large real-world networks are typically scale-free. Recent research has shown that such
graphs are described best in a geometric space. More precisely, the Internet can be mapped …

The blockchain paradigm provides a mechanism for content dissemination and distributed
consensus on Peer-to-Peer (P2P) networks. While this paradigm has been widely adopted …

We establish a bound for the classic PUSH-PULL rumor spreading protocol on general
graphs, in terms of the vertex expansion of the graph. We show that O (log2 (n)/α) rounds …

We propose and analyze a quasirandom analogue of the classical push model for
disseminating information in networks (" randomized rumor spreading"). In the classical …

We analyze randomized broadcast in dynamic networks modeled as edge‐Markovian
evolving graphs. The most realistic range of edge‐Markovian parameters yields sparse and …

In standard randomized (push-pull) rumor spreading, nodes communicate in synchronized
rounds. In each round every node contacts a random neighbor in order to exchange the …