Rapid Mixing of Dynamic Graphs with Local Evolution Rules - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Network Science and Engineering Année : 2019

Rapid Mixing of Dynamic Graphs with Local Evolution Rules

Résumé

Dynamic graphs arise naturally in many contexts. In peer-to-peer networks, for instance, a participating peer may replace an existing connection with one neighbor by a new connection with a neighbor of that neighbor. Several such local rewiring rules have been proposed to ensure that peer-to-peer networks achieve good connectivity properties (e.g. high expansion) at equilibrium. However, the question of whether there exists such a rule that converges rapidly to equilibrium has remained open. In this work, we provide an affirmative answer: we exhibit a local rewiring rule that converges to equilibrium after each participating node has undergone only a number of changes that is at most poly-logarithmic in the system size. As a byproduct, we derive new results for random walks on graphs, bounding the spread of their law throughout the transient phase, i.e. prior to mixing. These rely on an extension of Cheeger's inequality, based on generalized isoperimetric constants, and may be of independent interest.
Fichier principal
Vignette du fichier
ieee-author-final.pdf (447.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02427853 , version 1 (19-06-2020)

Identifiants

Citer

Laurent Massoulié, Rémi Varloot. Rapid Mixing of Dynamic Graphs with Local Evolution Rules. IEEE Transactions on Network Science and Engineering, 2019, pp.1. ⟨10.1109/TNSE.2019.2926887⟩. ⟨hal-02427853⟩
106 Consultations
120 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More