@book{MU,
  title={Probability and computing: Randomized algorithms and probabilistic analysis},
  author={Mitzenmacher, Michael and Upfal, Eli},
  year={2005},
  publisher={Cambridge University Press}
}

@INPROCEEDINGS{7354403,
author={Augustine, J. and Pandurangan, G. and Robinson, P. and Roche, S. and Upfal, E.},
booktitle={Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on},
title={Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks},
year={2015},
pages={350-369},
doi={10.1109/FOCS.2015.29},
ISSN={0272-5428},
month={Oct},}

@misc{Spielman,
  author        = {Daniel Spielman},
  title         = {Lecture notes in Spectral Graph Theory},
  year          = {2012},
  publisher={Yale University}
}


@article{TCS-010,
url = {http://dx.doi.org/10.1561/0400000010},
year = {2011},
volume = {7},
journal = {Foundations and Trends in Theoretical Computer Science},
title = {Pseudorandomness},
doi = {10.1561/0400000010},
issn = {1551-305X},
number = {1-3},
pages = {1-336},
author = {Salil P. Vadhan}
}





@article{metropolis,
author = {M. Metropolis and A. Rosenbluth and M. Rosenbluth and A. Teller and M. Teller},
title = {Equation of state calculations by fast computing machines},
journal = {Journal of Chemical Physics},
volume = {21},
year = {1953},
pages = {1087--1092},
}

@inproceedings{azar,
  title={Biased random walks},
  author={Azar, Yossi and Broder, Andrei Z and Karlin, Anna R and Linial, Nathan and Phillips, Steven},
  booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of computing},
  pages={1--9},
  year={1992},
  organization={ACM}
}




@article{Dutta:2015:CRW:2821462.2817830,
 author = {Dutta, Chinmoy and Pandurangan, Gopal and Rajaraman, Rajmohan and Roche, Scott},
 title = {Coalescing-Branching Random Walks on Graphs},
 journal = {ACM Trans. Parallel Comput.},
 issue_date = {October 2015},
 volume = {2},
 number = {3},
 month = nov,
 year = {2015},
 issn = {2329-4949},
 pages = {20:1--20:29},
 articleno = {20},
 numpages = {29},
 url = {http://doi.acm.org/10.1145/2817830},
 doi = {10.1145/2817830},
 acmid = {2817830},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Information spreading, cover time, epidemic processes},
} 




@article{sicomp,
  author    = {Jen-Yeu Chen and
               Gopal Pandurangan},
  title     = {Almost-Optimal Gossip-Based Aggregate Computation},
  journal   = {SIAM J. Comput.},
  volume    = {41},
  number    = {3},
  year      = {2012},
  pages     = {455-483}
  }




@inproceedings{panconesi1,
 author = {Chierichetti, Flavio and Lattanzi, Silvio and Panconesi, Alessandro},
 title = {Almost Tight Bounds for Rumour Spreading with Conductance},
 booktitle = {Proceedings of the Forty-second ACM Symposium on Theory of Computing},
 series = {STOC '10},
 year = {2010},
 isbn = {978-1-4503-0050-6},
 location = {Cambridge, Massachusetts, USA},
 pages = {399--408},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1806689.1806745},
 doi = {10.1145/1806689.1806745},
 acmid = {1806745},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {conductance, rumor spreading, social networks},
} 

@inproceedings{panconesi2,
author = {Flavio Chierichetti and Silvio Lattanzi and Alessandro Panconesi},
 author = {Chierichetti, Flavio and Lattanzi, Silvio and Panconesi, Alessandro},
 title = {Rumour Spreading and Graph Conductance},
 booktitle = {Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '10},
 year = {2010},
 isbn = {978-0-898716-98-6},
 location = {Austin, Texas},
 pages = {1657--1663},
 numpages = {7},
 url = {http://dl.acm.org/citation.cfm?id=1873601.1873736},
 acmid = {1873736},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 


 @article{feige-rumor,
  author = {Feige, Uriel and Peleg, David and Raghavan, Prabhakar and Upfal, Eli},
 title = {Randomized Broadcast in Networks},
 journal = {Random Structures \& Algorithms},
 year = {1990},
 pages = {447--460},
 publisher = {Wiley},
} 



@article{feige1,
  author = {Feige, U.},
 title = {A Tight Upper Bound on the Cover Time for Random Walks on Graphs},
 year = {1993},
 source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Aweizmann_il%3Ancstrl.weizmann_il%2F%2FCS93-08},
 publisher = {Weizmann Science Press of Israel},
 address = {Jerusalem, Israel, Israel},
} 

@article{feige2,
  author = {Feige, Uriel},
 title = {A Tight Lower Bound on the Cover Time for Random Walks on Graphs},
 journal = {Random Struct. Algorithms},
 issue_date = {July 1995},
 volume = {6},
 number = {4},
 month = jul,
 year = {1995},
 issn = {1042-9832},
 pages = {433--438},
 numpages = {6},
 url = {http://dx.doi.org/10.1002/rsa.3240060406},
 doi = {10.1002/rsa.3240060406},
 acmid = {259625},
 publisher = {John Wiley \& Sons, Inc.},
 address = {New York, NY, USA},
} 
  

@article{star-internet,
title = "A star-based model for the eigenvalue power law of Internet graphs ",
journal = "Physica A: Statistical Mechanics and its Applications ",
volume = "351",
number = "2–4",
pages = "680 - 686",
year = "2005",
note = "",
issn = "0378-4371",
doi = "http://dx.doi.org/10.1016/j.physa.2005.01.003",
url = "http://www.sciencedirect.com/science/article/pii/S0378437105000336",
author = "Francesc Comellas and Silvia Gago",
keywords = "Internet graph",
keywords = "Small-world scale-free networks",
keywords = "Power laws",
keywords = "Eigenvalues "
}
 
@inproceedings{gia1,
 author = {Giakkoupis, George and Sauerwald, Thomas},
 title = {Rumor Spreading and Vertex Expansion},
 booktitle = {Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '12},
 year = {2012},
 location = {Kyoto, Japan},
 pages = {1623--1641},
 numpages = {19},
 url = {http://dl.acm.org/citation.cfm?id=2095116.2095245},
 acmid = {2095245},
 publisher = {SIAM},
} 



@inproceedings{pana1,
author = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos and Sauerwald, Thomas},
 title = {Ultra-fast Rumor Spreading in Social Networks},
 booktitle = {Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '12},
 year = {2012},
 location = {Kyoto, Japan},
 pages = {1642--1660},
 numpages = {19},
 url = {http://dl.acm.org/citation.cfm?id=2095116.2095246},
 acmid = {2095246},
 publisher = {SIAM},
} 

@inproceedings{pana2, 
 author = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos},
 title = {Rumor Spreading on Random Regular Graphs and Expanders},
 booktitle = {Proceedings of the 13th International Conference on Approximation, and 14 the International Conference on Randomization, and Combinatorial Optimization: Algorithms and Techniques},
 series = {APPROX/RANDOM'10},
 year = {2010},
 isbn = {3-642-15368-2, 978-3-642-15368-6},
 location = {Barcelona, Spain},
 pages = {560--573},
 numpages = {14},
 url = {http://dl.acm.org/citation.cfm?id=1886521.1886565},
 acmid = {1886565},
 publisher = {Springer-Verlag},
 address = {Berlin, Heidelberg},
 keywords = {random regular graphs, rumor spreading},
} 


@article{panconesi3,
author = {Flavio Chierichetti and Silvio Lattanzi and Alessandro Panconesi},
title = "Rumor spreading in social networks ",
journal = "Theoretical Computer Science ",
volume = "412",
number = "24",
pages = "2602 - 2610",
year = "2011",
note = "Selected Papers from 36th International Colloquium on Automata, Languages and Programming (ICALP 2009) ",
issn = "0304-3975",
doi = "http://dx.doi.org/10.1016/j.tcs.2010.11.001",
url = "http://www.sciencedirect.com/science/article/pii/S0304397510006122",
author = "Flavio Chierichetti and Silvio Lattanzi and Alessandro Panconesi",
keywords = "Rumour spreading",
keywords = "Preferential attachment "
}




@article{ozalp1,
   author = {Jelasity, M\'{a}rk and Montresor, Alberto and Babaoglu, Ozalp},
 title = {T-Man: Gossip-based Fast Overlay Topology Construction},
 journal = {Comput. Netw.},
 issue_date = {August, 2009},
 volume = {53},
 number = {13},
 month = aug,
 year = {2009},
 issn = {1389-1286},
 pages = {2321--2339},
 numpages = {19},
 url = {http://dx.doi.org/10.1016/j.comnet.2009.03.013},
 doi = {10.1016/j.comnet.2009.03.013},
 acmid = {1570626},
 publisher = {Elsevier North-Holland, Inc.},
 address = {New York, NY, USA},
 keywords = {Bootstrapping, Gossip-based protocols, Overlay networks, Self-organizing middleware},
} 



@article{ozalp2,
author = "Ozalp Babaoglu and M{\'a}rk Jelasity",
	title = "Self-* properties through gossiping",
	journal = "Philosophical Transactions of the Royal Society A",
	volume = "366",
	number = "1881",
	year = "2008",
	month = oct,
	pages = "3747--3757",
	doi = "10.1098/rsta.2008.0122",
	pdfurl = "http://www.inf.u-szeged.hu/~jelasity/cikkek/rsta08.pdf"
}



@inproceedings{berns,
author = {Berns, Andrew and Ghosh, Sukumar and Pemmaraju, Sriram V.},
 title = {Brief Announcement: A Framework for Building Self-stabilizing Overlay Networks},
 booktitle = {Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing},
 series = {PODC '10},
 year = {2010},
 isbn = {978-1-60558-888-9},
 location = {Zurich, Switzerland},
 pages = {398--399},
 numpages = {2},
 url = {http://doi.acm.org/10.1145/1835698.1835790},
 doi = {10.1145/1835698.1835790},
 acmid = {1835790},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {overlay networks, self-stabilization},
} 


@inproceedings{jacob,
author = {Jacob, Riko and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and T\"{a}ubig, Hanjo},
 title = {A Distributed Polylogarithmic Time Algorithm for Self-stabilizing Skip Graphs},
 booktitle = {Proceedings of the 28th ACM Symposium on Principles of Distributed Computing},
 series = {PODC '09},
 year = {2009},
 isbn = {978-1-60558-396-9},
 location = {Calgary, AB, Canada},
 pages = {131--140},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1582716.1582741},
 doi = {10.1145/1582716.1582741},
 acmid = {1582741},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {peer-to-peer systems},
} 


@inproceedings{doerr,
author = {Doerr, Benjamin and Friedrich, Tobias and Sauerwald, Thomas},
 title = {Quasirandom Rumor Spreading},
 journal = {ACM Trans. Algorithms},
 issue_date = {November 2014},
 volume = {11},
 number = {2},
 month = oct,
 year = {2014},
 issn = {1549-6325},
 pages = {9:1--9:35},
 articleno = {9},
 numpages = {35},
 url = {http://doi.acm.org/10.1145/2650185},
 doi = {10.1145/2650185},
 acmid = {2650185},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Distributed computing, broadcasting, expander, quasirandomness, random graphs, rumor spreading},
} 
 
  
 @inproceedings{gia2,
author =	{George Giakkoupis},
  title =	{{Tight bounds for rumor spreading in graphs of a given conductance}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
  pages =	{57--68},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Thomas Schwentick and Christoph D{\"u}rr},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/2997},
  URN =		{urn:nbn:de:0030-drops-29977},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2011.57},
  annote =	{Keywords: conductance, rumor spreading}
}

 

@book{b1,
  editor = {Bornholdt, Stefan and Schuster, Heinz Georg},
 title = {Handbook of Graphs and Networks: From the Genome to the Internet},
 year = {2003},
 isbn = {3527403361},
 publisher = {John Wiley \& Sons, Inc.},
 address = {New York, NY, USA},
} 


@book{b2,
 author = {Newman, Mark and Barabasi, Albert-Laszlo and Watts, Duncan J.},
 title = {The Structure and Dynamics of Networks: (Princeton Studies in Complexity)},
 year = {2006},
 isbn = {0691113572},
 publisher = {Princeton University Press},
 address = {Princeton, NJ, USA},
} 

@book{b3,
  title = {Complex Social Networks},  
  author = {F. Vega-Redondo},
  publisher = {Cambridge University Press},
  year = {2007}
}

@inproceedings{law-siu,
author = {C. Law and K. Siu},
title = {An {$O(\log n)$} randomized resource discovery
algorithm},
booktitle = {DISC},
note = {Brief Announcement},
 year ={2000},
 pages ={5--8}
 }
 
 @INPROCEEDINGS{frieze1,
  author = {Chakrabarti, Soumen and Frieze, Alan and Vera, Juan},
 title = {The Influence of Search Engines on Preferential Attachment},
 booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '05},
 year = {2005},
 isbn = {0-89871-585-7},
 location = {Vancouver, British Columbia},
 pages = {293--300},
 numpages = {8},
 url = {http://dl.acm.org/citation.cfm?id=1070432.1070474},
 acmid = {1070474},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 



 
@INPROCEEDINGS{frieze2,
   author = {Cooper, Colin and Frieze, Alan},
 title = {Crawling on Web Graphs},
 booktitle = {Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing},
 series = {STOC '02},
 year = {2002},
 isbn = {1-58113-495-9},
 location = {Montreal, Quebec, Canada},
 pages = {419--427},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/509907.509970},
 doi = {10.1145/509907.509970},
 acmid = {509970},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{kuhn+lo:dynamic,
 author = {Kuhn, Fabian and Lynch, Nancy and Oshman, Rotem},
 title = {Distributed Computation in Dynamic Networks},
 booktitle = {Proceedings of the Forty-second ACM Symposium on Theory of Computing},
 series = {STOC '10},
 year = {2010},
 isbn = {978-1-4503-0050-6},
 location = {Cambridge, Massachusetts, USA},
 pages = {513--522},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1806689.1806760},
 doi = {10.1145/1806689.1806760},
 acmid = {1806760},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {distributed algorithms, dynamic networks},
} 

@inproceedings{kempe1, 
author = {Kempe, David and Kleinberg, Jon M.},
 title = {Protocols and Impossibility Results for Gossip-Based Communication Mechanisms},
 booktitle = {Proceedings of the 43rd Symposium on Foundations of Computer Science},
 series = {FOCS '02},
 year = {2002},
 isbn = {0-7695-1822-2},
 pages = {471--480},
 numpages = {10},
 url = {http://dl.acm.org/citation.cfm?id=645413.652161},
 acmid = {652161},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
} 

@inproceedings{kempe2, 
author = {Kempe, David and Kleinberg, Jon and Demers, Alan},
 title = {Spatial Gossip and Resource Location Protocols},
 booktitle = {Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing},
 series = {STOC '01},
 year = {2001},
 isbn = {1-58113-349-9},
 location = {Hersonissos, Greece},
 pages = {163--172},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/380752.380796},
 doi = {10.1145/380752.380796},
 acmid = {380796},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{chernoff,
 ajournal = "Ann. Math. Statist.",
 author = "Chernoff, Herman",
 doi = "10.1214/aoms/1177729330",
 journal = "The Annals of Mathematical Statistics",
 month = "12",
 number = "4",
 pages = "493--507",
 publisher = "The Institute of Mathematical Statistics",
 title = "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations",
 url = "http://dx.doi.org/10.1214/aoms/1177729330",
 volume = "23",
 year = "1952"
}

@article{hoeffding,
  author =       "Hoeffding, Wassily",
  title =        "Probability Inequalities for Sums of Bounded Random Variables",
  journal =      "Journal of the American Statistical Association",
  year =         "1963",
  volume =    "58",
  number =    "301",
  pages =     "13--30",
  month =     "March",
  url = "http://www.jstor.org/stable/2282952?",
  bib2html_rescat = "Bandits",
}

@article{angluin,
  author = {Angluin, Dana and Valiant, Leslie G.},
 title = {Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings},
 booktitle = {Proceedings of the Ninth Annual ACM Symposium on Theory of Computing},
 series = {STOC '77},
 year = {1977},
 location = {Boulder, Colorado, USA},
 pages = {30--41},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/800105.803393},
 doi = {10.1145/800105.803393},
 acmid = {803393},
 publisher = {ACM},
 address = {New York, NY, USA},
} 



@book{upfal,
 author = {Mitzenmacher, Michael and Upfal, Eli},
 title = {Probability and Computing: Randomized Algorithms and Probabilistic Analysis},
 year = {2005},
 isbn = {0521835402},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
} 



@article{jain+ms:steiner,
   author = {Jain, Kamal and Mahdian, Mohammad and Salavatipour, Mohammad R.},
 title = {Packing Steiner Trees},
 booktitle = {Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '03},
 year = {2003},
 isbn = {0-89871-538-5},
 location = {Baltimore, Maryland},
 pages = {266--274},
 numpages = {9},
 url = {http://dl.acm.org/citation.cfm?id=644108.644154},
 acmid = {644154},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 

@article{cheriyan+s:steiner,
 author = {Cheriyan, Joseph and Salavatipour, Mohammad R.},
 title = {Hardness and Approximation Results for Packing Steiner Trees},
 journal = {Algorithmica},
 issue_date = {April 2006},
 volume = {45},
 number = {1},
 month = apr,
 year = {2006},
 issn = {0178-4617},
 pages = {21--43},
 numpages = {23},
 url = {http://dx.doi.org/10.1007/s00453-005-1188-4},
 doi = {10.1007/s00453-005-1188-4},
 acmid = {1325660},
 publisher = {Springer-Verlag New York, Inc.},
 address = {Secaucus, NJ, USA},
 keywords = {Approximation algorithms, Hardness of approximation, Packing problems, Steiner trees},
} 



@article{charikar+ccdgg:steiner,
 author = {Charikar, Moses and Chekuri, Chandra},
 title = {Approximation Algorithms for Directed Steiner Problems},
 journal = {J. Algorithms},
 issue_date = {Oct. 1999},
 volume = {33},
 number = {1},
 month = oct,
 year = {1999},
 issn = {0196-6774},
 pages = {73--91},
 numpages = {19},
 url = {http://dx.doi.org/10.1006/jagm.1999.1042},
 doi = {10.1006/jagm.1999.1042},
 acmid = {334361},
 publisher = {Academic Press, Inc.},
 address = {Duluth, MN, USA},
 keywords = {Steiner tree problem, approximation algorithm, directed graph},
} 


@article{lau:steiner,
 author = {Lau\&\#x2020;, Lap Chi},
 title = {An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem},
 journal = {Combinatorica},
 issue_date = {February 2007},
 volume = {27},
 number = {1},
 month = feb,
 year = {2007},
 issn = {0209-9683},
 pages = {71--90},
 numpages = {20},
 url = {http://dx.doi.org/10.1007/s00493-007-0044-3},
 doi = {10.1007/s00493-007-0044-3},
 acmid = {1229815},
 publisher = {Springer-Verlag New York, Inc.},
 address = {Secaucus, NJ, USA},
 keywords = {05C40, 05C70, 68R10, 68W25},
} 




@article{guruswami+krsy,
 author = {Guruswami, Venkatesan and Khanna, Sanjeev and Rajaraman, Rajmohan and Shepherd, Bruce and Yannakakis, Mihalis},
 title = {Near-optimal Hardness Results and Approximation Algorithms for Edge-disjoint Paths and Related Problems},
 booktitle = {Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing},
 series = {STOC '99},
 year = {1999},
 isbn = {1-58113-067-8},
 location = {Atlanta, Georgia, USA},
 pages = {19--28},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/301250.301262},
 doi = {10.1145/301250.301262},
 acmid = {301262},
 publisher = {ACM},
 address = {New York, NY, USA},
} 



@article{ittai,
 author = {Abraham, Ittai and Dolev, Danny},
 title = {Asynchronous Resource Discovery},
 journal = {Comput. Netw.},
 issue_date = {14 July 2006},
 volume = {50},
 number = {10},
 month = jul,
 year = {2006},
 issn = {1389-1286},
 pages = {1616--1629},
 numpages = {14},
 url = {http://dx.doi.org/10.1016/j.comnet.2005.09.015},
 doi = {10.1016/j.comnet.2005.09.015},
 acmid = {1148386},
 publisher = {Elsevier North-Holland, Inc.},
 address = {New York, NY, USA},
 keywords = {asynchronous systems, resource discovery, union-find},
} 

@INPROCEEDINGS{leighton,
    author = {Harchol-Balter, Mor and Leighton, Tom and Lewin, Daniel},
 title = {Resource Discovery in Distributed Networks},
 booktitle = {Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing},
 series = {PODC '99},
 year = {1999},
 isbn = {1-58113-099-6},
 location = {Atlanta, Georgia, USA},
 pages = {229--237},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/301308.301362},
 doi = {10.1145/301308.301362},
 acmid = {301362},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{kutten,
  author = {Kutten, Shay and Peleg, David and Vishkin, Uzi},
 title = {Deterministic Resource Discovery in Distributed Networks},
 booktitle = {Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures},
 series = {SPAA '01},
 year = {2001},
 isbn = {1-58113-409-6},
 location = {Crete Island, Greece},
 pages = {77--83},
 numpages = {7},
 url = {http://doi.acm.org/10.1145/378580.378592},
 doi = {10.1145/378580.378592},
 acmid = {378592},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{dimitriov+p:coupon,
  uthor = {Dimitrov, Nedialko B. and Plaxton, C. Greg},
 title = {Optimal Cover Time for a Graph-based Coupon Collector Process},
 booktitle = {Proceedings of the 32Nd International Conference on Automata, Languages and Programming},
 series = {ICALP'05},
 year = {2005},
 isbn = {3-540-27580-0, 978-3-540-27580-0},
 location = {Lisbon, Portugal},
 pages = {702--716},
 numpages = {15},
 url = {http://dx.doi.org/10.1007/11523468_57},
 doi = {10.1007/11523468_57},
 acmid = {2104137},
 publisher = {Springer-Verlag},
 address = {Berlin, Heidelberg},
} 

@inproceedings{adler+hkv:p2p,
author = {Adler, Micah and Halperin, Eran and Karp, Richard M. and Vazirani, Vijay V.},
 title = {A Stochastic Process on the Hypercube with Applications to Peer-to-peer Networks},
 booktitle = {Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing},
 series = {STOC '03},
 year = {2003},
 isbn = {1-58113-674-9},
 location = {San Diego, CA, USA},
 pages = {575--584},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/780542.780626},
 doi = {10.1145/780542.780626},
 acmid = {780626},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {coupon collector, hash table, hypercube, load balancing, peer to peer},
} 



@article{alon:combinatorics,
   author = {Alon, Noga},
 title = {Problems and Results in Extremal combinatorics-II},
 journal = {Discrete Math.},
 issue_date = {October, 2008},
 volume = {308},
 number = {19},
 month = oct,
 year = {2008},
 issn = {0012-365X},
 pages = {4460--4472},
 numpages = {13},
 url = {http://dx.doi.org/10.1016/j.disc.2007.08.090},
 doi = {10.1016/j.disc.2007.08.090},
 acmid = {2653679},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 keywords = {Coupon collector, Covering codes, Extremal Graph Theory},
} 



@inproceedings{chen-spaa,
 author = {Chen, Jen-Yeu and Pandurangan, Gopal},
 title = {Optimal Gossip-based Aggregate Computation},
 booktitle = {Proceedings of the Twenty-second Annual ACM Symposium on Parallelism in Algorithms and Architectures},
 series = {SPAA '10},
 year = {2010},
 isbn = {978-1-4503-0079-7},
 location = {Thira, Santorini, Greece},
 pages = {124--133},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1810479.1810504},
 doi = {10.1145/1810479.1810504},
 acmid = {1810504},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {aggregate computation, distributed randomized protocols, gossip-based protocols, lower bounds, probabilistic analysis},
} 

@inproceedings{demers,
 author = {Demers, Alan and Greene, Dan and Hauser, Carl and Irish, Wes and Larson, John and Shenker, Scott and Sturgis, Howard and Swinehart, Dan and Terry, Doug},
 title = {Epidemic Algorithms for Replicated Database Maintenance},
 booktitle = {Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing},
 series = {PODC '87},
 year = {1987},
 isbn = {0-89791-239-X},
 location = {Vancouver, British Columbia, Canada},
 pages = {1--12},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/41840.41841},
 doi = {10.1145/41840.41841},
 acmid = {41841},
 publisher = {ACM},
 address = {New York, NY, USA},
} 



@inproceedings{MIH,
  author = {Mihail, M.},
 title = {Conductance and Convergence of Markov Chains-a Combinatorial Treatment of Expanders},
 booktitle = {Proceedings of the 30th Annual Symposium on Foundations of Computer Science},
 series = {SFCS '89},
 year = {1989},
 isbn = {0-8186-1982-1},
 pages = {526--531},
 numpages = {6},
 url = {http://dx.doi.org/10.1109/SFCS.1989.63529},
 doi = {10.1109/SFCS.1989.63529},
 acmid = {1398642},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 keywords = {general irreversible Markov chains, combinatorial argument, convergence rate, conductance, random walks, expanders, linear algebra, time-reversible Markov chains},
} 


@inproceedings{shah,
 author = {Mosk-Aoyama, Damon and Shah, Devavrat},
 title = {Computing Separable Functions via Gossip},
 booktitle = {Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing},
 series = {PODC '06},
 year = {2006},
 isbn = {1-59593-384-0},
 location = {Denver, Colorado, USA},
 pages = {113--122},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1146381.1146401},
 doi = {10.1145/1146381.1146401},
 acmid = {1146401},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {data aggregation, gossip, randomized algorithms},
} 

@inproceedings{karp,
 author = {Karp, R. and Schindelhauer, C. and Shenker, S. and Vocking, B.},
 title = {Randomized Rumor Spreading},
 booktitle = {Proceedings of the 41st Annual Symposium on Foundations of Computer Science},
 series = {FOCS '00},
 year = {2000},
 isbn = {0-7695-0850-2},
 pages = {565--},
 url = {http://dl.acm.org/citation.cfm?id=795666.796561},
 acmid = {796561},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 keywords = {address-oblivious algorithm, commmunication complexity, communication complexity, communication optimality, communication overhead, database theory, distributed database copies, epidemic algorithms, information theory, lazy update transmission, lower bound, message transmissions, parallel rounds, random telephone calls, randomised algorithms, randomized communication mechanism, randomized rumor spreading, randomly selected communication partner, replicated databases, robustness, time optimality},
} 


@article{DRG,
 author = {Chen, Jen-Yeu and Pandurangan, Gopal and Xu, Dongyan},
 title = {Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis},
 journal = {IEEE Trans. Parallel Distrib. Syst.},
 issue_date = {September 2006},
 volume = {17},
 number = {9},
 month = sep,
 year = {2006},
 issn = {1045-9219},
 pages = {987--1000},
 numpages = {14},
 url = {http://dx.doi.org/10.1109/TPDS.2006.128},
 doi = {10.1109/TPDS.2006.128},
 acmid = {1159251},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
 keywords = {Probabilistic algorithms, Probabilistic algorithms, randomized algorithms, distributed algorithms, sensor networks, fault tolerance, graph theory, aggregate, data query, stochastic processes., aggregate, data query, distributed algorithms, fault tolerance, graph theory, randomized algorithms, sensor networks, stochastic processes.},
} 


@conference{kempe,
author = {Kempe, David and Dobra, Alin and Gehrke, Johannes},
 title = {Gossip-Based Computation of Aggregate Information},
 booktitle = {Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science},
 series = {FOCS '03},
 year = {2003},
 isbn = {0-7695-2040-5},
 pages = {482--},
 url = {http://dl.acm.org/citation.cfm?id=946243.946317},
 acmid = {946317},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
} 

@article{boyd,
author = {Boyd, S. and Ghosh, A. and Prabhakar, B. and Shah, D.},
 title = {Randomized Gossip Algorithms},
 journal = {IEEE Trans. Inf. Theor.},
 issue_date = {June 2006},
 volume = {52},
 number = {6},
 month = jun,
 year = {2006},
 issn = {0018-9448},
 pages = {2508--2530},
 numpages = {23},
 url = {http://dx.doi.org/10.1109/TIT.2006.874516},
 doi = {10.1109/TIT.2006.874516},
 acmid = {2272253},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
 keywords = {Distributed averaging, gossip, random walk, scaling laws, semidefinite programming, sensor networks}
} 
  
@incollection{lovasz-survey,
 added-at = {2011-03-14T01:04:48.000+0100},
  address = {Budapest},
  author = {Lov\'asz, L.},
  biburl = {http://www.bibsonomy.org/bibtex/21cf08f78e2e63db6047a0d47c28c6987/lantiq},
  booktitle = {Combinatorics, Paul Erd\H{o}s is Eighty},
  editor = {{Mikl\'os}, D. and {S\'os}, V. T. and {Sz\H{o}nyi}, T.},
  file = {full text:Lovasz1996.pdf:PDF},
  groups = {public},
  interhash = {a5b3bcb5e23eaf611d2c08f513bb7b0e},
  intrahash = {1cf08f78e2e63db6047a0d47c28c6987},
  keywords = {networks structure dynamics},
  pages = {353-398},
  publisher = {J\'anos Bolyai Mathematical Society},
  timestamp = {2011-03-14T01:04:48.000+0100},
  title = {Random Walks on Graphs: A Survey},
  username = {lantiq},
  volume = 2,
  year = 1996
}


@inproceedings{berenbrink,
 author = {Berenbrink, Petra and Cooper, Colin and Els\"{a}sser, Robert and Radzik, Tomasz and Sauerwald, Thomas},
 title = {Speeding Up Random Walks with Neighborhood Exploration},
 booktitle = {Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '10},
 year = {2010},
 isbn = {978-0-898716-98-6},
 location = {Austin, Texas},
 pages = {1422--1435},
 numpages = {14},
 url = {http://dl.acm.org/citation.cfm?id=1873601.1873716},
 acmid = {1873716},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 


@inproceedings{DP05,
  author = {Dimitrov, Nedialko B. and Plaxton, C. Greg},
 title = {Optimal Cover Time for a Graph-based Coupon Collector Process},
 booktitle = {Proceedings of the 32Nd International Conference on Automata, Languages and Programming},
 series = {ICALP'05},
 year = {2005},
 isbn = {3-540-27580-0, 978-3-540-27580-0},
 location = {Lisbon, Portugal},
 pages = {702--716},
 numpages = {15},
 url = {http://dx.doi.org/10.1007/11523468_57},
 doi = {10.1007/11523468_57},
 acmid = {2104137},
 publisher = {Springer-Verlag},
 address = {Berlin, Heidelberg},
} 


@INPROCEEDINGS{GANESH, 
  author = {Ganesh, Ayalvadi J. and Massouli, Laurent and Towsley, Donald F.},
  booktitle = {INFOCOM},
  date = {2006-10-04},
  description = {dblp},
  ee = {http://dx.doi.org/10.1109/INFCOM.2005.1498374},
  interhash = {573b4ac58d9c1efe81c1a76f5c6de16f},
  intrahash = {837b777e0dd7c4391b13c65352346d0f},
  keywords = {graphtheory network routing sna},
  pages = {1455-1466},
  publisher = {IEEE},
  timestamp = {2007-03-22T17:53:22.000+0100},
  title = {The effect of network topology on the spread of epidemics.},
  url = {http://dblp.uni-trier.de/db/conf/infocom/infocom2005.html#GaneshMT05},
  year = 2005
}
  
@ARTICLE{KES,
  ajournal = "J. Appl. Probab.",
author = "Kessler, David A.",
doi = "10.1239/jap/1222441828",
journal = "Journal of Applied Probability",
month = "09",
number = "3",
pages = "757--778",
publisher = "Applied Probability Trust",
title = "Epidemic size in the SIS model of endemic infections",
url = "http://dx.doi.org/10.1239/jap/1222441828",
volume = "45",
year = "2008"
}


@article {PIET,
 author = {Van Mieghem, Piet},
 title = {The N-intertwined SIS Epidemic Network Model},
 journal = {Computing},
 issue_date = {December 2011},
 volume = {93},
 number = {2-4},
 month = dec,
 year = {2011},
 issn = {0010-485X},
 pages = {147--169},
 numpages = {23},
 url = {http://dx.doi.org/10.1007/s00607-011-0155-y},
 doi = {10.1007/s00607-011-0155-y},
 acmid = {2141984},
 publisher = {Springer-Verlag New York, Inc.},
 address = {New York, NY, USA},
 keywords = {Mean-field approximation, Networks, Robustness},
} 



@inproceedings{ER09,
 author = {Efremenko, Klim and Reingold, Omer},
 title = {How Well Do Random Walks Parallelize?},
 booktitle = {Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
 series = {APPROX '09 / RANDOM '09},
 year = {2009},
 isbn = {978-3-642-03684-2},
 location = {Berkeley, CA},
 pages = {476--489},
 numpages = {14},
 url = {http://dx.doi.org/10.1007/978-3-642-03685-9_36},
 doi = {10.1007/978-3-642-03685-9_36},
 acmid = {1616535},
 publisher = {Springer-Verlag},
 address = {Berlin, Heidelberg},
 keywords = {Markov Chains, Random Walks},
} 



    @article{FILL,
     jstor_articletype = {research-article},
     title = {Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process},
     author = {Fill, James Allen},
     journal = {The Annals of Applied Probability},
     jstor_issuetitle = {},
     volume = {1},
     number = {1},
     jstor_formatteddate = {Feb., 1991},
     pages = {pp. 62-87},
     url = {http://www.jstor.org/stable/2959625},
     language = {English},
     year = {1991},
     publisher = {Institute of Mathematical Statistics},
    }


@inproceedings{Berger:2005:SVI:1070432.1070475,
author = {Berger, Noam and Borgs, Christian and Chayes, Jennifer T. and Saberi, Amin},
 title = {On the Spread of Viruses on the Internet},
 booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
 series = {SODA '05},
 year = {2005},
 isbn = {0-89871-585-7},
 location = {Vancouver, British Columbia},
 pages = {301--310},
 numpages = {10},
 url = {http://dl.acm.org/citation.cfm?id=1070432.1070475},
 acmid = {1070475},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
} 

@ARTICLE{KAHALE,
    author = {Kahale, Nabil},
 title = {Eigenvalues and Expansion of Regular Graphs},
 journal = {J. ACM},
 issue_date = {Sept. 1995},
 volume = {42},
 number = {5},
 month = sep,
 year = {1995},
 issn = {0004-5411},
 pages = {1091--1106},
 numpages = {16},
 url = {http://doi.acm.org/10.1145/210118.210136},
 doi = {10.1145/210118.210136},
 acmid = {210136},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Ramanujan graphs, eigenvalues, expander graphs, induced subgraphs, load balancing, random walks, selection networks},
} 


@book{chung2006complex,
  title={Complex graphs and networks},
  author={Chung, F.R.K. and Lu, L. and Conference Board of the Mathematical Sciences and National Science Foundation (U.S.)},
  number={no. 107},
  isbn={9780821836576},
  lccn={2006042898},
  series={CBMS Regional Conference Ser. in Mathematics Series},
  url={http://books.google.com/books?id=BqqDsEKlAE4C},
  year={2006},
  publisher={American Mathematical Society}
}


@book{LevinPeresWilmer2006,
   title = "Markov chains and mixing times",
   author = "Levin, David Asher and Peres, Yuval and Wilmer, Elizabeth Lee",
   publisher = "Providence, R.I. American Mathematical Society",
   url = "http://opac.inria.fr/record=b1128575",
   isbn = "978-0-8218-4739-8",
   note = "With a chapter on coupling from the past by James G. Propp and David B. Wilson.",
   year = 2009
}

@ARTICLE{Chung05laplaciansand,
    author = {Chung, F.},
    citeulike-article-id = {5974540},
    journal = {Annals of Combinatorics},
    keywords = {cheeger\_constant, graphs, rayleigh\_quotient, reversible\_markov\_chains},
    pages = {1--19},
    posted-at = {2009-10-20 13:52:30},
    priority = {2},
    title = {Laplacians and the Cheeger Inequality for Directed Graphs},
    volume = {9},
    year = {2005}
}


@MISC{spielman-notes,
    author = {Spieman, Daniel},
    institution = {Yale University}, 
    howpublished = {Class Lecture Notes},
    year = {2012},
    title = {{Spectral Graph Theory}},
    url = {http://www.cs.yale.edu/homes/spielman/561/},
}

@inproceedings{haeupler:gossip,
author = {B. Haeupler},
title = {Analyzing network coding gossip made easy},
booktitle = {ACM STOC},
year = {2011}
}