References
- [1] M. Bayati, J. H. Kim and A. Saberi, A sequential algorithm for generating random graphs, Algorithmica58 (2010) 860–910. ⇒184, 185, 186
- [2] E. A. Bender and E. R. Canfield, The assymptotic number of labelled graphs with given degree sequence, J. Combin. Theory, Ser A.24, 3 (1978) 296–307. ⇒184, 185
- [3] J. Blitzstein and P. Diaconis, A sequential importance sampling algorithm for generating random graphs with prescribed degree sequence, Internet Math.6,4 (2011) 489–522. ⇒184, 185, 186
- [4] B. Bollobas, A probalistic proof of an assymptotic formula for the number of labelled regular graphs, European J. Combin.1, 4 (1980) 311–316. ⇒184, 185
- [5] R. A. Brualdi, Matrices of zeroes and ones with fixed row and column sum vectors, Linear Algebra Appl.33 (1980) 159–231. ⇒184
- [6] T. Brylawsky and J. Oxley, The Tutte polynomial and its applications,inN. White, ed., Matroid Applications, Encyclopedia of Mathematics and its Applications, Cambridge University Press, (1992) 123–225. ⇒185
- [7] Y. Chen,P.Diaconis, S. Holmes andJ.S.Liu,SequentialMonte Carlomethods for statistical analysis of tables, J. Am. Stat. Assoc.100 (2005) 109–120. ⇒184
- [8] G. W. Cobb and Y. Chen, An application of Markov Chains Monte Carlo to community ecology, Amer. Math. Month.110 (2003) 265–288. ⇒184
- [9] C. Cooper,M. Dyer and C. Greenhill, Sampling regular graphs and Peer-to-Peer network, Combinatorics, Probability and Computing16 (2007) 557–594. ⇒184
- [10] P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins, In Discrete Probability and Algorithms (Minneapolis, MN, 1993), IMA Vol. Math. Appl.72 15–41, New York Springer, 1995. ⇒184
- [11] P. Diaconnis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, Ann Statist.26, 11 (1998) 363–397. ⇒184
- [12] P. Erdös and T. G. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok11 (1960) 264–274. ⇒184, 185
- [13] M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput.18, 6 (1989) 1149–1178. ⇒184
- [14] R. Kannan, P. Tetali and S. Vempala, Simple Markov-chain algorithms for generating bipartite graphs and tournaments, Random Struct. Algorithms14, 4 (1999) 293–308. ⇒184, 185
- [15] K. K. Kayibi,M.A. Khan and S. Pirzada, Rejection sampling of bipartite graphs with given degree sequence, Acta Univ. Sapientia, Mathematica10, 2 (2018) 249–275. ⇒183, 184
- [16] M. Luby, D. Randall and A. Sinclair, Markov chain algorithms for planar lattice structures, SIAM J. Comput.31, 1 (2001) 167–192. ⇒184
- [17] I. Miklós,P.L. Erdös and L. Soukup, Towards random uniform sampling of bipartite graphs with given degree sequence, Preprint. ⇒184, 185
- [18] M. E. J. Newman,A.L.Barabasiand D. J. Watts, The structure and dynamics of networks (Princeton Studies in Complexity, Princeton UP) (2006) pp 624. ⇒184
- [19] S. Pirzada, An Introduction to Graph Theory, Universities Press, Hyderabad, India, 2012. ⇒185
- [20] V. V. Vazirani, Approximation algorithms, Springer-Verlag, Berlin, Heildelberg, New York, 2003. ⇒184
- [21] N. Wormald, Models of random regular graphs, In Surveys in Combonatorics (Canterbury), Cambridge University Press, London, Math. Soc. Lecture Note Ser.267 (1999) 239–298. ⇒184, 185