The graphs that arise from concrete applications seem to correspond to models with prescribed degree sequences. We present two algorithms for the uniform random generation of graphic sequences. We prove their correctness. We empirically evaluate their performance. To our knowledge these algorithms are the first non trivial algorithms proposed for this task. The algorithms that we propose are Markov chain Monte Carlo algorithms. Our contribution is the original design of the Markov chain and the empirical evaluation of mixing time. © 2011 Springer-Verlag.
CITATION STYLE
Lu, X., & Bressan, S. (2011). Generating random graphic sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6587 LNCS, pp. 570–579). https://doi.org/10.1007/978-3-642-20149-3_41
Mendeley helps you to discover research relevant for your work.