Uniform sampling of digraphs with a fixed degree sequence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6410 LNCS, Issue , 2010, Pages 220-231

  Berger, Annabell ^a   Müller Hannemann, Matthias ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY DEGREE; DEGREE SEQUENCE; MARKOV CHAIN; NETWORK ANALYSIS; PRESCRIBED DEGREE SEQUENCE; RECOGNITION ALGORITHM; STATE GRAPHS; STRONGLY CONNECTED; SWITCHING ALGORITHMS; UNIFORM DISTRIBUTION; UNIFORM SAMPLING;

ALGORITHMS; COMPUTER SCIENCE; ELECTRIC NETWORK ANALYSIS; MARKOV PROCESSES;

GRAPH THEORY;

EID: 78650204553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16926-7_21     Document Type: Conference Paper

References (28)

1. Milo, R., Kashtan, N., Itzkovitz, S., Newman, M., Alon, U.: On the uniform generation of random graphs with arbitrary degree sequences, arXiv:cond-mat/0312028v2 (May 30, 2004)
2. Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., Alon, U.: Superfamilies of evolved and designed networks. Science 303, 1538-1542 (2004)
3. Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability & Computing 1, 351-370 (1992)
4. Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Basel (1993)
5. Lovász, L.: Random walks on graphs: A survey. In: D.M., et al. (eds.) Combinatorics, Paul Erdocombining double acute accents is Eighty, vol. 2, pp. 353-397. János Bolyai Mathematical Society (1996)
6. Ryser, H.J.: Combinatorial properties of matrices of zeroes and ones. Canadian J. of Mathematics 9, 371-377 (1957)
7. Chen,W.: On the realization of a (p,s)-digraph with prescribed degrees. J. Franklin Institute 281, 406-422 (1966)
8. Tutte, W.: The factors of graphs. Canadian J. of Mathematics 4, 314-328 (1952)
9. Kleitman, D., Wang, D.: Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math. 6, 79-88 (1973)
10. Havel, V.: A remark on the existence of finite graphs. Časopis Pěst. Mat. 80, 477-480 (1955)
11. Hakimi, S.: On the realizability of a set of integers as degrees of the vertices of a simple graph. SIAM J. Appl. Math. 10, 496-506 (1962)
12. Hakimi, S.: On the degrees of the vertices of a directed graph. J. Franklin Institute 279, 290-308 (1965)
13. Erdocombining double acute accents, P.L., Miklós, I., Toroczkai, Z.: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs. The Electronic Journal of Combinatorics 17, #R66 (2010)
14. Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Structures and Algorithms 14, 293-308 (1999)
15. Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and a peer-to-peer network. Combinatorics, Probability and Computing 16, 557-593 (2007) (Pubitemid 46882962)
16. Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM 51, 671-697 (2004)
17. Bezáková, I., Bhatnagar, N., Vigoda, E.: Sampling binary contingency tables with a greedy start. Random Structures and Algorithms 30, 168-205 (2007)
18. McKay, B., Wormald, N.: Uniform generation of random regular graphs of moderate degree. J. Algorithms 11, 52-67 (1990)
19. 1/2). Combinatorica 11, 369-382 (1991)
20. Steger, A., Wormald, N.: Generating random regular graphs quickly. Combinatorics, Probability, and Computing 8, 377-396 (1999) (Pubitemid 129640093)
21. Kim, J., Vu, V.: Generating random regular graphs. In: STOC, pp. 213-222 (2003)
22. Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica (2009) doi 10.1007/s00453-009-9340-1
23. Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method: An approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, pp. 482-520. PWS Publishing, Boston (1996)
24. Rao, A., Jana, R., Bandyopadhyay, S.: A Markov chain Monte Carlo method for generating random (0,1)-matrices with given marginals. Sankhya: The Indian Journal of Statistics 58, 225-242 (1996)
25. LaMar, M.D.: Algorithms for realizing degree sequences for directed graphs, arXiv.org:0906.0343v1 (2009)
26. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298, 824-827 (2002) (Pubitemid 35231534)
27. Koschützki, D., Lehmann, K.A., Peeters, L., Richter, S., Tenfelde-Podehl, D., Zlotowski, O.: Centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 16-61. Springer, Heidelberg (2005)
28. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)