Switching edges to randomize networks: What goes wrong and how to fix it

Journal of Complex Networks

Volumn 5, Issue 3, 2017, Pages 337-351

  Carstens, C J ^a,b   Horadam, K J ^a  

^a RMIT UNIVERSITY   (Australia)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Fixed degree sequence; Markov chain; Random networks; Switching model; Unbiased sampling

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; MARKOV PROCESSES; RANDOM PROCESSES;

ANALYSIS TECHNIQUES; COMMUNITY DETECTION; DEGREE SEQUENCE; RANDOM NETWORK; RANDOM NETWORK MODELS; STATIONARY DISTRIBUTION; SWITCHING MODEL; UNBIASED SAMPLINGS;

SWITCHING;

EID: 85021716435     PISSN: 20511310     EISSN: 20511329     Source Type: Journal    
DOI: 10.1093/comnet/cnw027     Document Type: Article

References (34)

1. Artzy-Randrup, Y. & Stone, L. (2005) Generating uniformly distributed random networks. Phys. Rev. E, 72, 056708
2. Carstens, C. J. (2014) A uniform random graph model for directed acyclic networks and its effect on motiffinding. J. Complex Netw., 2, 419-430
3. Carstens, C. J. (2015) Proof of uniform sampling of binary matrices with fixed row sums and column sums for the fast curveball algorithm. Phys. Rev. E, 91, 042812
4. Molloy, M. & Reed, B. (1995) A critical point for random graphs with a given degree sequence. Random Struct. Algorithms, 6, 161-180
5. Newman, M. E. J., Strogatz, S. H. & Watts, D. J. (2001) Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E, 64, 026118
6. Snijders, T. A. B. (1991) Enumeration and simulation methods for 0âL"1 matrices with given marginals. Psychometrika, 56, 397-417
7. King, O. D. (2004) Comment on "subgraphs in random networks". Phys. Rev. E, 70, 058101
8. Klein-Hennig, H. & Hartmann, A. K. (2012) Bias in generation of random graphs. Phys. Rev. E, 85, 026101
9. Miklós, I. & Podani, J. (2004) Randomization of presence-absence matrices: comments and new algorithms. Ecology, 85, 86-92
10. Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J. & Alon, U. (2003) On the uniform generation of random graphs with prescribed degree sequences. arXiv preprint arXiv:cond-mat/0312028
11. Maslov, S. & Sneppen, K. (2002) Specificity and stability in topology of protein networks. Science, 296, 910-913
12. Rao, A. R., Jana, R. & Bandyopadhyay, S. (1996) A Markov chain Monte Carlo method for generating random (0, 1)-matrices with given marginals. Sankhya Indian J. Stat. Ser. A, 58, 225-242
13. Roberts, E. S. & Coolen, A. C. C. (2012) Unbiased degree-preserving randomization of directed binary networks. Phys. Rev. E, 85, 046103
14. Taylor, R. (1981) Constrained switchings in graphs. Combinatorial Mathematics VIII. Berlin: Springer, pp. 314-336
15. Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S. Ayzenshtat, I., Sheffer, M. & Alon, U. (2004) Superfamilies of evolved and designed networks. Science, 303, 1538-1542
16. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D. & Alon, U. (2002) Network motifs: simple building blocks of complex networks. Science, 298, 824-827
17. Greenhill, C. (2011) A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs. Electron. J. Combin., 18, P234
18. Kannan, R., Tetali, P. & Vempala, S. (1999) Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms, 14, 293-308
19. Miklós, I., Erdös, P. L. & Soukup, L. (2013) Towards random uniform sampling of bipartite graphs with given degree sequence. Electron. J. Combin., 20, P16
20. Rechner, S. & Berger, A. (2016) Marathon: an open source software library for the analysis of markov-chain monte carlo algorithms. PLoS One, 11, e0147935
21. Ray, J., Pinar, A. & Seshadhri, C. (2014)Astopping criterion for Markov chains when generating independent random graphs. J. Complex Netw., 3, 204-220
22. Coolen, A. C. C., De Martino, A. & Annibale, A. (2009) Constrained Markovian dynamics of random graphs. J. Stat. Phys., 136, 1035-1067
23. Mitzenmacher, M. & Upfal, E. (2005) Probability and Computing: Randomized Algorithms and Probabilistic Analysis. New York: Cambridge University Press
24. Berger, A. & Müller-Hannemann, M. (2010) Uniform sampling of digraphs with a fixed degree sequence. Graph Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Berlin: Springer, pp. 220-231
25. Ryser, H. J. (1963) Combinatorial mathematics. Carus Mathematical Monographs. The Mathematical Association of America, New York, NY: Wiley
26. Berger, A. (2011) Directed degree sequences. Ph.D. Thesis, Martin-Luther University Halle-Wittenberg. Retrieved from http://wcms.itz.uni-halle.de/download.php?down=22851&elem=1624638 (accessed on September 21, 2016)
27. Roberts, E. S., Annibale, A. & Coolen, A. C. C. (2014) Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties. Nonlinear Maps and Their Applications. New York: Springer, pp. 25-34
28. Berger, A. & Müller-Hannemann, M. (2009) Uniform sampling of undirected and directed graphs with a fixed degree sequence. arXiv preprint arXiv:0912.0685
29. Eggleton, R. B. & Holton, D. A. (1981) Simple and multigraphic realizations of degree sequences. Combinatorial Mathematics VIII (K. L. McAvaney ed.). Berlin: Springer, pp. 155-172
30. Eggleton, R. B. & Holton, D. A. (1979) The graph of type (0, ∞, ∞) realizations of a graphic sequence. Combinatorial Mathematics VI (C. Grácio, D. Fournier-Prunaret, T. Ueta Y. Nishio eds), NewYork: Springer, pp. 41-54
31. Hakimi, S. (1962) On realizability of a set of integers as degrees of the vertices of a linear graph. I. J. Soc. Ind. Appl. Math., 10, 496-506
32. Bunke, H., Dickinson, P. J., Kraetzl, M. & Wallis, W. D. (2007) A Graph-Theoretic Approach to Enterprise Network Dynamics. Basel: Birkhauser
33. Ray, J., Pinar, A. & Seshadhri, C. (2012) Are we there yet? when to stop a Markov chain while generating random graphs. Algorithms and Models for the Web Graph (A. Bonato & J. Janssen eds), vol. 7323. Lecture Notes in Computer Science. Berlin: Springer, pp. 153-164
34. Zhao, J. (2013) Expand and contract: sampling graphs with given degrees and other combinatorial families. arXiv preprint arXiv:1308.6627