Related papers: Rumor Spreading on Random Regular Graphs and Expan…
In this paper, we study the spread of a classical SIR process on a two-layer random network, where the first layer represents the households, while the second layer models the contacts outside the households by a random scale-free graph. We…
In earlier work, we showed that it is possible to achieve $O(\log N)$ streaming delay with high probability in a peer-to-peer network, where each peer has as little as four neighbors, while achieving any arbitrary fraction of the maximum…
Information, ideas, and diseases, or more generally, contagions, spread over space and time through individual transmissions via social networks, as well as through external sources. A detailed picture of any diffusion process can be…
One major function of social networks (e.g., massive online social networks) is the dissemination of information, such as scientific knowledge, news, and rumors. Information can be propagated by the users of the network via natural…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
We consider a scenario of broadcasting information over a network of nodes connected by noiseless communication links. A source node in the network has $k$ data packets to broadcast, and it suffices that a large fraction of the network…
We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number…
Temporal networks, whose links are activated or deactivated over time, are used to represent complex systems such as social interactions or collaborations occurring at specific times. Such networks facilitate the spread of information and…
We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information…
One major function of social networks (e.g., massive online social networks) is the dissemination of information such as scientific knowledge, news, and rumors. Information can be propagated by the users of the network via natural…
We use network coding to improve the speed of distributed computation in the dynamic network model of Kuhn, Lynch and Oshman [STOC '10]. In this model an adversary adaptively chooses a new network topology in every round, making even basic…
In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$…
The push-sum algorithm allows distributed computing of the average on a directed graph, and is particularly relevant when one is restricted to one-way and/or asynchronous communications. We investigate its behavior in the presence of…
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours…
We study the stopping times of gossip algorithms for network coding. We analyze algebraic gossip (i.e., random linear coding) and consider three gossip algorithms for information spreading Pull, Push, and Exchange. The stopping time of…
We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with…
Spread of information in crowd is analysed in terms of directed percolation in two-dimensional spatial network. We investigate the case when the information transmitted can be incomplete or damaged. The results indicate that for small or…
The burst in the use of online social networks over the last decade has provided evidence that current rumor spreading models miss some fundamental ingredients in order to reproduce how information is disseminated. In particular, recent…
Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step,…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…