Flooding in dynamic graphs with arbitrary degree sequence

• We study the flooding time in dynamic random graphs with arbitrary degree sequence.
• In the case of power-law degree sequences, the flooding time is almost surely log(n)log(n).
• In the general case, upper bounds depend on specific properties of the sequence.

This paper addresses the flooding problem in dynamic graphs, where flooding is the basic mechanism in which every node becoming aware of a piece of information at step tt forwards this information to all its neighbors at all forthcoming steps t′>tt′>t. We show that a technique developed in a previous paper, for analyzing flooding in a Markovian sequence of Erdös–Rényi graphs, is robust enough to be used also in different contexts. We establish this fact by analyzing flooding in a sequence of graphs drawn independently at random according to a model of random graphs with given expected degree sequence. In the prominent case of power-law degree distributions, we prove that flooding takes almost surely O(logn)O(logn) steps even if, almost surely, none of the graphs in the sequence is connected. In the general case of graphs with an arbitrary degree sequence, we prove several upper bounds on the flooding time, which depend on specific properties of the degree sequence.