Distributed Agreement on Activity Driven Networks
arXiv:1801.07412 · doi:10.23919/ACC.2018.8431658
Abstract
In this paper, we investigate asymptotic properties of a consensus protocol taking place in a class of temporal (i.e., time-varying) networks called the activity driven network. We first show that a standard methodology provides us with an estimate of the convergence rate toward the consensus, in terms of the eigenvalues of a matrix whose computational cost grows exponentially fast in the number of nodes in the network. To overcome this difficulty, we then derive alternative bounds involving the eigenvalues of a matrix that is easy to compute. Our analysis covers the regimes of 1) sparse networks and 2) fast-switching networks. We numerically confirm our theoretical results by numerical simulations.
References in corpus (9)
- Temporal Networks
- Activity driven modeling of time varying networks
- Modern temporal network theory: A colloquium
- Sufficient Conditions for Fast Switching Synchronization in Time Varying Network Topologies
- Random walks and search in time-varying networks
- Temporal networks: slowing down diffusion by long lasting interactions
- Quantifying the effect of temporal resolution on time-varying networks
- Topological properties of a time-integrated activity driven network
- Temporal interactions facilitate endemicity in the susceptible-infected-susceptible epidemic model