Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence

Proceedings - Winter Simulation Conference

Volumn , Issue , 2011, Pages 3348-3359

  LaMar, M Drew ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE SEQUENCE; UNIFORM SAMPLING; VERTEX SET;

CIRCUIT SIMULATION; SOFTWARE ENGINEERING;

DIRECTED GRAPHS;

EID: 84858066446     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2011.6148031     Document Type: Conference Paper

References (17)

1. Berge, C. 1973. "Graphs and hypergraphs". North-Holland Publishing Company.
2. Berger, A., and M. Mller-Hannemann. 2010. "Uniform Sampling of Digraphs with a Fixed Degree Sequence". In Graph Theoretic Concepts in Computer Science, edited by D. Thilikos, Volume 6410 of Lecture Notes in Computer Science, 220-231. Springer Berlin / Heidelberg.
3. Blitzstein, J., and P. Diaconis. 2011. "A sequential importance sampling algorithm for generating random graphs with prescribed degrees". Internet Math. 6 (4): 489-522.
4. Cobb, G.W., and Y.-P. Chen. 2003. "An application of Markov Chain Monte Carlo to community ecology". The American Mathematical Monthly 110 (4): 265-288. (Pubitemid 36446401)
5. del Genio, C. I., H. Kim, Z. Toroczkai, and K. E. Bassler. 2010, March. "Efficient and exact sampling of simple graphs with given arbitrary degree sequence". PLoS ONE 5 (4): 1-7.
6. Erdös, P. L., I. Miklós, and Z. Toroczkai. 2010, April. "A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs". The Electronic Journal of Combinatorics 17 (1): 1-10.
7. Feder, T., P. Hell, S. Klein, and R. Motwani. 2003, January. "List Partitions". SIAM J. Discrete Math. 16 (3): 449-478.
8. Fulkerson, D. R. 2004, March. "Zero-one matrices with zero trace". Pacific Journal of Mathematics 10 (3): 831-836.
9. Kim, H., Z. Toroczkai, P. L. Erdös, I. Miklós, and L. Székely. 2009, September. "Degree-based graph construction". Journal of Physics A: Mathematical and Theoretical 42:1-11.
10. LaMar, M. D. 2010a, June. "Algorithms for realizing degree sequences of directed graphs". arXiv:0906.0343.
11. LaMar, M. D. 2010b, May. "Split digraphs". arXiv:1005.2452.
12. Liljeros, F., C. R. Edling, L. A. Amaral, H. E. Stanley, and Y. Aberg. 2001, June. "The web of human sexual contacts". Nature 411 (6840): 907-908.
13. Lovasz, L. 1993, January. "Random walks on graphs: A survey". Combinatorics 2:1-46.
14. Mahadev, N. V. R., and U. N. Peled. 1995, September. Threshold Graphs and Related Topics, Volume 56 (Annals of Discrete Mathematics). 1 ed. North Holland.
15. Rao, A., R. Jana, and S. Bandyopadhyay. 1996. "A Markov chain Monte Carlo method for generating random (0,1)-matrices with given marginals". Sankhya Ser. A 58 (2): 225-242.
16. Rao, S. 1981. "A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences". In Combinatorics and Graph Theory, edited by S. Rao, Volume 885 of Lecture Notes in Mathematics, 417-440. Springer Berlin / Heidelberg. 10.1007/BFb0092288.
17. Roberts, J. 2000. "Simple methods for simulating sociomatrices with given marginal totals". Social Networks 22 (3): 273-283.