Gossip and Mixing Times of Random Walks on Random Graphs (2004)
| Citations: | 12 - 0 self |
BibTeX
@MISC{Boyd04gossipand,
author = {Stephen Boyd and Arpita Ghosh and Balaji Prabhakar and Devavrat Shah},
title = {Gossip and Mixing Times of Random Walks on Random Graphs},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Motivated by applications to sensor and ad hoc networks, we study distributed algorithms for passing information and for computing averages in an arbitrarily connected network of nodes. Our work draws upon and contributes to a growing body of literature in three areas: (i) Distributed averaging algorithms, as formulated in Kempe, Dobra and Gehrke (2003), (ii) geometric random graph models for large networks of sensors, as put forth in Gupta and Kumar (2000), and (iii) the fastest mixing Markov chain on a graph, as studied recently in Boyd, Diaconis and Xiao (2003). For distributed averaging...
