Efficient generation of networks with given expected degrees

Authors:
Joel C. Miller;Aric Hagberg
Affiliations:
Center for Communicable Disease Dynamics, Harvard School of Public Health, Boston, MA and Fogarty International Center, National Institute of Health, Bethesda, MD;Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM
Venue:
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Year:
2011

Citing 5
Cited 2

Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Structural and algorithmic aspects of massive social networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The Volume of the Giant Component of a Random Graph with Given Expected Degrees

SIAM Journal on Discrete Mathematics
The phase transition in inhomogeneous random graphs

Random Structures & Algorithms
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents

Discrete Event Dynamic Systems

Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Exact and efficient generation of geometric random variates and random graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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 → ∞.