Skip to content
Implementations for Generating Labeled k-degenerate Graphs.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.

k-degenerate Graph Generator(s)

These are a series of Python generators used for uniform k-degenerate graph generation dependent on specific parameters.

  1. Parameters that can be modified include number of vertices, number of edges, maximum degeneracy, number of graphs generated, and different model specifications.
  2. Polytopes of sampled graphs can be plotted.


To run a simulation:

python [vertices] [degeneracy] [samples] [[models]]

python [vertices] [edges] [degeneracy] [samples] Currently under construction

Currently supported models: edge, triangle, degseq, star [num] (k-stars)

To plot the estimated DERGM polytope:

python Works with CSV Edge-Triangle model at the moment

Monte Carlo MLE and Entropy plots can be found running dergminfo.R


python 10 6 10 edge triangle star 3 degseq

Models: ['Edge', 'Triangle', 'Degree Sequence', '3-star']
18      4       2,4,5,4,4,3,3,3,5,3     36
15      3       3,4,3,2,4,1,2,3,6,2     31
19      9       2,4,4,4,3,2,6,3,3,7     70
21      10      3,7,6,3,3,5,4,5,2,4     86
25      18      6,4,5,6,5,6,2,4,6,6     128
24      16      6,3,6,4,5,5,4,3,7,5     115
17      4       3,3,3,4,2,6,3,2,3,5     39
22      14      4,2,4,6,6,5,5,4,2,6     92
23      14      5,4,6,6,2,3,4,7,4,5     108
25      19      4,6,6,5,5,4,7,7,3,3     140


The basis for this code comes from the work of Bauer, Krug, and Wagner in Enumerating and Generating Labeled k-degenerate Graphs

Results from this code can be found in DERGMs: Degeneracy-restricted exponential random graph models (Karwa, Petrovic, Bajic)

You can’t perform that action at this time.