In this paper we investigate distributed computation in dynamic networks in which the
network topology changes from round to round. We consider a worst-case model in which …

The study of dynamic networks has come into popularity recently, and many models and
algorithms for such networks have been suggested. In this column we survey some recent …

We study several variants of coordinated consensus in dynamic networks. We assume a
synchronous model, where the communication graph for each round is chosen by a worst …

A graph whose edges only appear at certain points in time is called a temporal graph
(among other names). Such a graph is temporally connected if each ordered pair of vertices …

An edge-Markovian process with birth-rate p and death-rate q generates sequences of
graphs (G 0, G 1, G 2,…) with the same node set [n] such that Gt is obtained from G t− 1 as …

We study how to spread k tokens of information to every node on an n-node dynamic
network, the edges of which are changing at each round. This basic gossip problem can be …

= 1We introduce stochastic time-dependency in evolving graphs: starting from an initial
graph, at every time step, every edge changes its state (existing or not) according to a two …

We introduce projection analysis-a new technique to analyze the stop** time of gossip
protocols that are based on random linear network coding (RLNC). Projection analysis …

Distributing multiple replicas in geographically-dispersed clouds is a popular approach to
reduce latency to users. It is important to ensure that each replica should have availability …

We present a general approach to study the flooding time (a measure of how fast information
spreads) in dynamic graphs (graphs whose topology changes with time according to a …