@conference {
	title = {Average Consensus over Small World Networks: A Probabilistic Framework},
	author = {Hovareshti, Pedram., Baras, John S., Gupta, Vijay.},
	year = {2008},
	month = {12/2008},
	abstract = {It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable example is the class of ring-structured Watts-Strogatz small world graphs. Building on probabilistic methods for analyzing {\textquoteleft}small-world phenomena{\textquoteright}, developed in our earlier work, we provide here a probabilistic framework for analyzing this effect. We investigate what graph characteristics lead to such a significant improvement and develop bounds to analyze consensus problems on randomly varying graphs.},
	address = {Cancun, Mexico},
	booktitle = {47th IEEE Conference on Decision and Control},
	pages = {pp. 375-380}
}
