Sampling regular graphs and a peer-to-peer network

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 980-988

  Cooper, Colin ^a   Dyer, Martin ^b   Greenhill, Catherine ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER NETWORKS; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

PEER-TO-PEER NETWORKS; POLYNOMIAL TIME; RANDOM WALKS; REGULAR GRAPHS;

GRAPH THEORY;

EID: 20744446589     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal of Combinatorics 1 (1980), 311-316.
2. V. Bourassa and F. Holt, SWAN: Small-world wide area networks, in Proc. International Conference on Advances in Infrastructure (SSGRR 2003w), L'Aquila, Italy, 2003, paper #64. Available at http://www.panthesis.com/content/ swan_white_paper.pdf
3. C. Cooper, M. Dyer and C. Greenhill, Sampling regular graphs and a peer-to-peer network, pre-print of full paper, 2004. Available from http://wvw.maths.unsw.edu.au/~csg/papers/cdg-preprint.pdf
4. C. Cooper, R. Klasing and T. Radzik, Self maintaining networks, pre-print, 2004.
5. A. Frieze, On random regular graphs with non-constant degree, Research report 88-2, Department of Mathematics, Carnegie-Mellon University, 1988.
6. L. Goldberg and M. Jerrum, Private communication, 2004.
7. S. Janson, T. Łuczak and A. Ruciński, Random Graphs, Wiley and Sons, New York, 2000.
8. M. Jerrum, A. Sinclair and B. McKay, When is a graphical sequence stable?, in Random Graphs, Vol. 2 (Poznań, 1989), Wiley, New York, 1992, pp. 101-115.
9. M. Jerrum and A. Sinclair, Fast uniform generation of regular graphs, Theoretical Computer Science 73 (1990), 91-100.
10. M. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, in Proceedings of the 33rd annual ACM Symposium on Theory of Computing, ACM Press (2001), pp. 712-721.
11. R. Kannan, P. Tetali and S. Vempala, Simple Markov-chain algorithms for generating bipartite graphs and tournaments, Random Structures and Algorithms 14 (1999), 293-308.
12. B. McKay and N. Wormald, Uniform generation of random regular graphs of moderate degree, Journal of Algorithms 11 (1990), 52-67.
13. G. Pandurangan, P. Raghavan and E. Upfal, Building low-diameter peer-to-peer networks, IEEE Journal on Selected Areas in Communications 26 (2003), 995-1002.
14. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combinatorics, Probability and Computing 1 (1992), 351-370.
15. A. Steger and N. Wormald, Generating random regular graphs quickly, Combinatorics, Probability and Computing 8 (1999), 377-396.
16. G. Tinhofer, On the generation of random graphs with given properties and known distribution, Applied Computer Science Berichte zur Praktische Informatik 13 (1979), 265-297.
17. N. Wormald, Models of random regular graphs, in Surveys in Combinatorics, 1999 (J. Lamb and D. Preece eds.), London Math. Soc. Lecture Notes Series 267, CUP, 1999, pp. 239-298.