Related papers: Rumours spread slowly in a small world spatial net…
Expanders are sparse graph that are strongly connected, where {\it connectivity} is quantified using eigenvalues of the adjacency matrix, and {\it sparsity} in terms of vertex valency. We give a model of random graphs and study their…
The study of rumor models from a percolation theory point of view has gained a few adepts in the last few years. The persistence of a rumor, which may consistently spread out throughout a population can be associated to the existence of a…
In this work, the spread of a contagious disease on a society where the individuals may take precautions is modeled. The primary assumption is that the infected individuals transmit the infection to the susceptible members of the community…
In the following work, we compare the spread of information by word-of-mouth (WOM) to the spread of information through search engines. We assume that the initial acknowledgement of new information derives from social interactions but that…
Multilayer networks are the underlying structures of multiple real-world systems where we have more than one type of interaction/relation between nodes: social, biological, computer, or communication, to name only a few. In many cases, they…
Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative, or both, and many variants of this problem have been…
Critical thinking and skepticism are fundamental mechanisms that one may use to prevent the spreading of rumors, fake-news and misinformation. We consider a simple model in which agents without previous contact with the rumor, being…
News spread in internet media outlets can be seen as a contagious process generating temporal networks representing the influence between published articles. In this article we propose a methodology based on the application of natural…
We study diffusion and consensus dynamics in a Network of Networks model. In this model, there is a collection of sub-networks, connected to one another using a small number of links. We consider a setting where the links between networks…
This paper analyzes the adoption of unstructured P2P overlay networks to build publish-subscribe systems. We consider a very simple distributed communication protocol, based on gossip and on the local knowledge each node has about…
The rapid spread of rumors in social media is mainly caused by individual retweets. This paper applies uncertainty time series analysis (UTSA) to analyze a rumor retweeting behavior on Weibo. First, the rumor forwarding is modeled using…
We consider information dissemination in a large $n$-user wireless network in which $k$ users wish to share a unique message with all other users. Each of the $n$ users only has knowledge of its own contents and state information; this…
We perform a thorough study of various characteristics of the asynchronous push-pull protocol for spreading a rumor on Erd\H{o}s-R\'enyi random graphs $G_{n,p}$, for any $p>c\ln(n)/n$ with $c>1$. In particular, we provide a simple strategy…
Infectious diseases are studied to understand their spreading mechanisms, to evaluate control strategies and to predict the risk and course of future outbreaks. Because people only interact with a small number of individuals, and because…
A fundamental question related to innovation diffusion is how the social network structure influences the process. Empirical evidence regarding real-world influence networks is very limited. On the other hand, agent-based modeling…
We introduce an intuitive model that describes both the emergence of community structure and the evolution of the internal structure of communities in growing social networks. The model comprises two complementary mechanisms: One mechanism…
The use of network theory to model disease propagation on populations introduces important elements of reality to the classical epidemiological models. The use of random geometric graphs (RGG) is one of such network models that allows for…
When modelling epidemics or spread of information on online social networks, it is crucial to include not just the density of the connections through which infections can be transmitted, but also the variability of susceptibility. Different…
We study a gossip protocol called forwarding without repeating (FWR). The objective is to spread multiple rumors over a graph as efficiently as possible. FWR accomplishes this by having nodes record which messages they have forwarded to…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…