A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 69-76

  Feder, Tomás ^a   Guetz, Adam ^b   Mihail, Milena ^c   Saberi, Amin ^b  

^a Stanford University ^*  (United States)

^b STANFORD UNIVERSITY   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORKING PRACTICE; PEER-TO-PEER NETWORKS; REGULAR GRAPHS;

DISTRIBUTED COMPUTER SYSTEMS; EMBEDDED SYSTEMS; GRAPH THEORY;

MARKOV PROCESSES;

EID: 38749147727     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.5     Document Type: Conference Paper

References (23)

1. C. Berge, "The Theory of Graphs and its Applications". Methuen, London, (1962).
2. I. Bezáková, N. Bhatnagar and E. Vigoda, "Sampling binary contingency tables with a greedy start", submitted, (2005).
3. C. Cooper, M. Dyer and C. Greenhill, "Sampling regular graphs and a peer-to-peer network.", SODA (2005), 980-988. (journal version available at www.maths.unsw.edu.au/csg/publications.html)
4. M. Dyer, L. Goldberg, M. Jerrum and R. Martin, "Markov chain comparison", arxiv.org, (2004).
5. C. Gkantsidis, M. Mihail and A. Saberi, "On the Random Walk Method in Peer-to-Peer Networks", INFOCOM (2004).
6. C. Gkantsidis, M. Mihail and E. Zegura, "The Markov chain simulation method for generating connected power law random graphs", ALENEX-SODA (2003).
7. S. Janson, T. Luczak and A. Rucinski, "Random graphs", Wiley and Sons, New York, (2000).
8. M. Jerrum and A. Sinclair, "Fast uniform generation of regular graphs", Theoret. Comput. Sci., 73, 1, 91-100, (1990).
9. M. Jerrum and A. Sinclair in "Approximation Algorithms for NP-hard Problems", D.S.Hochbaum ed., PWS Publishing, Boston, (1996).
10. M. Jerrum, A. Sinclair and B. McKay, "When is a graphical sequence stable? In Random graphs", Vol. 2 (Poznan, 1989). Wiley-Intersci. Publ. Wiley, New York, 101-115.
11. B.D. McKay, "Asymptotics for symmetric 0-1 matrices with prescribed row sums", Ars Combinatoria, 19A (1985) 15-25.
12. B.D. McKay and N.C. Wormald, "Asymptotic enumeration by degree sequence of graphs of high degree", European J. Combinatorics, 11 (1990) 565-580.
13. 1/2)", Combinatorica (1991) 369-382.
14. R. Kannan, P. Tetali and S. Vempala, "Simple Markov-chain algorithms for generating bipartite graphs and tournaments", Random Structures and Algorithms 14(4): 293-308 (1999).
15. P. Mahlmann and C. Schindelhauer, "Peer-to-peer networks based on random transformations of connected regular undirected graphs", SPAA (Symposium on Parallelism in Algorithms and Architectures), Las Vegas, NV (2005).
16. B. D. McKay and N. C. Wormald, "Uniform generation of random regular graphs of moderate degree", Journal of Algorithms 11(1), (1990), 52-67.
17. H. Garcia-Molina, private communication.
18. M. Mihail and N. Vishnoi, "On Generating Graphs with Prescribed Degree Sequences for Complex Network Modeling Applications", Position Paper, ARACNE (Approx. and Randomized Algorithms for Communication Networks), Rome, IT, (2002).
19. F. Viger and M. Latapy, "Fast generation of random connected graphs with prescribed degrees", Preprint (2005).
20. A. Sinclair, "Improved bounds for mixing rates of Markov chains and multicommodity flow", Combinatorics, Probability and Computing 1 (1992), 351-370.
21. A. Steger and N. Wormald, "Generating random regular graphs quickly", Combinatorics, Probability and Computing 8, (1999), 377-396.
22. R. Taylor, "Constrained switchings in graphs", SIAM J. Alg. DISC. METH., 3(1):115-121, (1982).
23. N. Wormald, "Models of random regular graphs", Surveys in Combinatorics, 1999 (J. Lamb and D Preece eds.), London Math. Soc. Lecture Notes Series 267, CUP, (1999), 239-298.