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 Erdős is Eighty, vol. 2, pp. 353–397. János Bolyai Mathematical Society (1996)