Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks

by   Ali Pourmiri, et al.

The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. Starting with a single informed node, each node is associated with an exponential time clock with rate 1 and calls a random neighbor in order to possibly exchange the rumor. Spread time is the first time when all nodes of a network are informed with high probability. We consider spread time of the algorithm in any dynamic evolving network, ๐’ข={G^(t)}_t=0^โˆž, which is a sequence of graphs exposed at discrete time step t=0,1.... We observe that besides the expansion profile of a dynamic network, the degree distribution of nodes over time effect the spread time. We establish upper bounds for the spread time in terms of graph conductance and diligence. For a given connected simple graph G=(V,E), the diligence of cut set E(S, S) is defined as ฯ(S)=min_{u,v}โˆˆ E(S,S)max{dฬ…/d_u, dฬ…/d_v} where d_u is the degree of u and dฬ… is the average degree of nodes in the one side of the cut with smaller volume (i.e., ๐šŸ๐š˜๐š•(S)=โˆ‘_uโˆˆ Sd_u). The diligence of G is also defined as ฯ(G)=min_โˆ…โ‰  SโŠ‚ Vฯ(S). We show that the spread time of the algorithm in ๐’ข is bounded by T, where T is the first time that โˆ‘_t=0^Tฮฆ(G^(t))ยทฯ(G^(t)) exceeds Clog n, where ฮฆ(G^(t)) denotes the conductance of G^(t) and C is a specified constant. We also define the absolute diligence as ฯ(G)=min_{u,v}โˆˆ Emax{1/d_u,1/d_v} and establish upper bound T for the spread time in terms of absolute diligence, which is the first time when โˆ‘_t=0^TโŒˆฮฆ(G^(t))โŒ‰ยทฯ(G^(t))> 2n. We present dynamic networks where the given upper bounds are almost tight.


page 1

page 2

page 3

page 4

โˆ™ 07/29/2020

Expansion and Flooding in Dynamic Random Networks with Node Churn

We study expansion and information diffusion in dynamic networks, that i...
โˆ™ 11/28/2018

Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information

We consider ad-hoc networks consisting of n wireless nodes that are loca...
โˆ™ 01/05/2021

Spread and defend infection in graphs

The spread of an infection, a contagion, meme, emotion, message and vari...
โˆ™ 06/04/2018

Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents

We consider the problem of spread of information among mobile agents on ...
โˆ™ 12/28/2020

Bounded-Degree Cut is Fixed-Parameter Tractable

In the bounded-degree cut problem, we are given a multigraph G=(V,E), tw...
โˆ™ 11/30/2022

Distributed Averaging in Population Protocols

We consider two simple asynchronous opinion dynamics on arbitrary graphs...
โˆ™ 09/04/2023

Local Certification of Majority Dynamics

In majority voting dynamics, a group of n agents in a social network are...

Please sign up or login with your details

Forgot password? Click here to reset