random_degree_sequence_graph

random_degree_sequence_graph(sequence, seed=None, tries=10)

Return a simple random graph with the given degree sequence.

If the maximum degree in the sequence is then the algorithm produces almost uniform random graphs in time where is the number of edges.

Parameters :

sequence : list of integers

Sequence of degrees

seed : hashable object, optional

Seed for random number generator

tries : int, optional

Maximum number of tries to create a graph

Returns :

G : Graph

A graph with the specified degree sequence. Nodes are labeled starting at 0 with an index corresponding to the position in the sequence.

Raises :

NetworkXUnfeasible :

If the degree sequence is not graphical.

NetworkXError :

If a graph is not produced in specified number of tries

See also

is_valid_degree_sequence, configuration_model

Notes

The generator algorithm [R194] is not guaranteed to produce a graph.

References

[R194]

(1, 2) Moshen Bayati, Jeong Han Kim, and Amin Saberi, A sequential algorithm for generating random graphs. Algorithmica, Volume 58, Number 4, 860-910, DOI: 10.1007/s00453-009-9340-1

Examples

>>> sequence = [1, 2, 2, 3]
>>> G = nx.random_degree_sequence_graph(sequence)
>>> sorted(G.degree().values())
[1, 2, 2, 3]