Related papers: Critical threshold and dynamics of a general rumor…
We study the synchronization transition in scale-free networks that display power-law asymptotic behaviors in their degree distributions. The critical coupling strength and the order-parameter critical exponent derived by the mean field…
We study a general framework for broadcast gossip algorithms which use companion variables to solve the average consensus problem. Each node maintains an initial state and a companion variable. Iterative updates are performed asynchronously…
Hierarchical models of scale free networks are introduced where numbers of nodes in clusters of a given hierarchy are stochastic variables. Our models show periodic oscillations of degree distribution P(k) in the log-log scale. Periods and…
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic…
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the…
Large cascades are a common occurrence in many natural and engineered complex systems. In this paper we explore the propagation of cascades across networks using realistic network topologies, such as heterogeneous degree distributions, as…
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. In…
This paper describes and analyzes a hierarchical gossip algorithm for solving the distributed average consensus problem in wireless sensor networks. The network is recursively partitioned into subnetworks. Initially, nodes at the finest…
We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the…
Two node variables determine the evolution of cascades in random networks: a node's degree and threshold. Correlations between both fundamentally change the robustness of a network, yet, they are disregarded in standard analytic methods as…
Research in network science has shown that many naturally occurring and technologically constructed networks are scale free, that means a power law degree distribution emerges from a growth model in which each new node attaches to the…
Current social networks are of extremely large-scale generating tremendous information flows at every moment. How information diffuse over social networks has attracted much attention from both industry and academics. Most of the existing…
Burstiness, the tendency of interaction events to be heterogeneously distributed in time, is critical to information diffusion in physical and social systems. However, an analytical framework capturing the effect of burstiness on generic…
Several systems can be modeled as sets of interdependent networks where each network contains distinct nodes. Diffusion processes like the spreading of a disease or the propagation of information constitute fundamental phenomena occurring…
In this paper we theoretically and empirically study the degree and connectivity of the Internet's scale-free topology at the autonomous system (AS) level. The basic features of the scale-free network have influence on the normalization…
We present a detailed analytical and numerical study for the spreading of infections in complex population networks with acquired immunity. We show that the large connectivity fluctuations usually found in these networks strengthen…
This paper focuses on non-asymptotic diffusion time in asynchronous gossip protocols. Asynchronous gossip protocols are designed to perform distributed computation in a network of nodes by randomly exchanging messages on the associated…
Epidemic spreading processes in the real world can interact with each other in a cooperative, competitive, or asymmetric way, requiring a description based on coevolution dynamics. Rich phenomena such as discontinuous outbreak transitions…
We discuss the behavior of large ensembles of phase oscillators networking via scale-free topologies in the presence of a positive correlation between the oscillators' natural frequencies and network's degrees. In particular, we show that…
Spreading processes on networks are ubiquitous in both human-made and natural systems. Understanding their behavior is of broad interest; from the control of epidemics to understanding brain dynamics. While in some cases there exists a…