Note
Click here to download the full example code
Expected Degree SequenceΒΆ
Random graph from given degree sequence.
Out:
Degree histogram
degree (#nodes) ****
0 ( 0)
1 ( 0)
2 ( 0)
3 ( 0)
4 ( 0)
5 ( 0)
6 ( 0)
7 ( 0)
8 ( 0)
9 ( 0)
10 ( 0)
11 ( 0)
12 ( 0)
13 ( 0)
14 ( 0)
15 ( 0)
16 ( 0)
17 ( 0)
18 ( 0)
19 ( 0)
20 ( 0)
21 ( 0)
22 ( 0)
23 ( 0)
24 ( 0)
25 ( 0)
26 ( 0)
27 ( 1) *
28 ( 0)
29 ( 0)
30 ( 0)
31 ( 0)
32 ( 1) *
33 ( 0)
34 ( 2) **
35 ( 1) *
36 ( 0)
37 ( 3) ***
38 ( 5) *****
39 ( 8) ********
40 ( 7) *******
41 ( 5) *****
42 (14) **************
43 (11) ***********
44 (16) ****************
45 (26) **************************
46 (30) ******************************
47 (31) *******************************
48 (25) *************************
49 (28) ****************************
50 (34) **********************************
51 (35) ***********************************
52 (32) ********************************
53 (30) ******************************
54 (23) ***********************
55 (30) ******************************
56 (10) **********
57 (18) ******************
58 (13) *************
59 (12) ************
60 (13) *************
61 ( 7) *******
62 ( 5) *****
63 ( 5) *****
64 ( 3) ***
65 ( 6) ******
66 ( 1) *
67 ( 3) ***
68 ( 4) ****
69 ( 1) *
70 ( 0)
71 ( 1) *
# Author: Aric Hagberg (hagberg@lanl.gov)
# Copyright (C) 2006-2019 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
# All rights reserved.
# BSD license.
import networkx as nx
from networkx.generators.degree_seq import expected_degree_graph
# make a random graph of 500 nodes with expected degrees of 50
n = 500 # n nodes
p = 0.1
w = [p * n for i in range(n)] # w = p*n for all nodes
G = expected_degree_graph(w) # configuration model
print("Degree histogram")
print("degree (#nodes) ****")
dh = nx.degree_histogram(G)
for i, d in enumerate(dh):
print("%2s (%2s) %s" % (i, d, '*'*d))
Total running time of the script: ( 0 minutes 0.036 seconds)