Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence

Open Access

Peer-reviewed

Research Article

Charo I. Del Genio,

Affiliations Department of Physics, University of Houston, Houston, Texas, United States of America, Texas Center for Superconductivity (TcSUH), University of Houston, Houston, Texas, United States of America
⨯
Hyunju Kim,

Affiliation Interdisciplinary Center for Network Science and Applications (iCeNSA), University of Notre Dame, Notre Dame, Indiana, United States of America
⨯
Zoltán Toroczkai,

Affiliation Interdisciplinary Center for Network Science and Applications (iCeNSA), University of Notre Dame, Notre Dame, Indiana, United States of America
⨯
Kevin E. Bassler

* E-mail: Kevin.E.Bassler@mail.uh.edu

Affiliations Department of Physics, University of Houston, Houston, Texas, United States of America, Texas Center for Superconductivity (TcSUH), University of Houston, Houston, Texas, United States of America
⨯

Reader Comments

A graph sampling code implementing the algorithm described in this article is available for download and use at http://www.biond.org/node...

No competing interests declared.

Graphs
Is the Subject Area "Graphs" applicable to this article?

Thanks for your feedback.
Algorithms
Is the Subject Area "Algorithms" applicable to this article?

Thanks for your feedback.
Probability distribution
Is the Subject Area "Probability distribution" applicable to this article?

Thanks for your feedback.
Random graphs
Is the Subject Area "Random graphs" applicable to this article?

Thanks for your feedback.
Internet
Is the Subject Area "Internet" applicable to this article?

Thanks for your feedback.
Markov models
Is the Subject Area "Markov models" applicable to this article?

Thanks for your feedback.
Monte Carlo method
Is the Subject Area "Monte Carlo method" applicable to this article?

Thanks for your feedback.
Social epidemiology
Is the Subject Area "Social epidemiology" applicable to this article?

Thanks for your feedback.