Generating random graphic sequences

  • Xuesong Lu*
  • , Stéphane Bressan
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 16th International Conference, DASFAA 2011, Proceedings
Pages570-579
Number of pages10
EditionPART 1
DOIs
StatePublished - 2011
Externally publishedYes
Event16th International Conference on Database Systems for Advanced Applications, DASFAA 2011 - Hong Kong, China
Duration: 22 Apr 201125 Apr 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6587 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Database Systems for Advanced Applications, DASFAA 2011
Country/TerritoryChina
CityHong Kong
Period22/04/1125/04/11

Fingerprint

Dive into the research topics of 'Generating random graphic sequences'. Together they form a unique fingerprint.

Cite this