networkx.expected_degree_graph

expected_degree_graph(w, seed=None)

Return a random graph G(w) with expected degrees given by w.

Parameters:

• w: a list of expected degrees
• seed: seed for random number generator (default=None)

>>> z=[10 for i in range(100)]
>>> G=nx.expected_degree_graph(z)

Reference:

@Article{connected-components-2002,
  author =        {Fan Chung and L. Lu},
  title =         {Connected components in random graphs
  with given expected degree sequences},
  journal =       {Ann. Combinatorics},
  year =          {2002},
  volume =        {6},
  pages =         {125-145},
  }