Related papers: Information Spreading in Random Graphs Evoving by …
This paper discusses a simple stochastic model for the spread of messages in a large population with two types of individuals: transmitters and receivers. Transmitters, after receiving the message, start spreading copies of the message to…
We establish a bound for the classic PUSH-PULL rumor spreading protocol on arbitrary graphs, in terms of the vertex expansion of the graph. We show that O(log^2(n)/\alpha) rounds suffice with high probability to spread a rumor from a single…
The problem of link prediction has attracted considerable recent attention from various domains such as sociology, anthropology, information science, and computer sciences. A link prediction algorithm is proposed based on link similarity…
In this paper, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed…
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability…
We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this…
If a piece of information is released from a media site, can it spread, in 1 month, to a million web pages? This influence estimation problem is very challenging since both the time-sensitive nature of the problem and the issue of…
We propose a framework for the derivation and evaluation of distributed iterative algorithms for receiver cooperation in interference-limited wireless systems. Our approach views the processing within and collaboration between receivers as…
We study message transport on a $1-d$ ring of nodes and randomly distributed hubs. Messages are deposited on the network at a constant rate. When the rate at which messages are deposited on the lattice is very high, messages start…
Preferential attachment is a popular generative mechanism to explain the widespread observation of power law distributed networks. We introduce an alternative explanation for the phenomenon by allowing the link growth rates to vary across…
There is currently growing interest in modeling the information diffusion on social networks across multi-disciplines. The majority of the corresponding research has focused on information diffusion independently, ignoring the network…
Junior, Machado and Zuluaga (2011) studied a model to understand the spread of a rumour. Their model consists of individuals situated at the integer points of the line $\N$. An individual at the origin $0$ starts a rumour and passes it to…
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed…
Reliable propagation of information through large networks, e.g., communication networks, social networks or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks.…
Our work introduces an approach for estimating the contribution of attachment mechanisms to the formation of growing networks. We present a generic model in which growth is driven by the continuous attachment of new nodes according to…
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…
This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…
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…
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…
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal fraction of neighbors of a given node that interchange information among each…