With the prevalence of social networks, it has become increasingly important to understand
their features and limitations. It has been observed that information spreads extremely fast in …

We study the connection between the rate at which a rumor spreads throughout a graph and
the conductance of the graph--a standard measure of a graph's expansion properties. We …

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step
every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is …

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 …

Consider a graph G=(V, E) G=(V, E) and an initial random coloring where each vertex v ∈ V
v∈ V is blue with probability P_b P b and red otherwise, independently from all other …

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 study the relation between the rate at which rumors spread throughout a graph and the
vertex expansion of the graph. We consider the standard rumor spreading protocol where …

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 …