Abstract
We present an efficient algorithm to generate random graphs with a given sequence of expected degrees. Existing algorithms run in O (N2) time where N is the number of nodes. We prove that our algorithm runs in O(N + M) expected time where M is the expected number of edges. If the expected degrees are chosen from a distribution with finite mean, this is O(N) as N→∞. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Miller, J. C., & Hagberg, A. (2011). Efficient generation of networks with given expected degrees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6732 LNCS, pp. 115–126). https://doi.org/10.1007/978-3-642-21286-4_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
