Lila
30 April 2024 08:15
1
I’m utilizing the “sample_degseq” function in the igraph package to generate null models. I would like to know how this function works in detail and mainly in what order the edges are assigned to respect the degrees of the vertices.
Please have a look at the documentation of the C library, and let us know if you have remaining questions.
https://igraph.org/c/html/latest/igraph-Generators.html#igraph_degree_sequence_game
The R interface still uses the old names for the available methods. To match up the names you see in R with the C documentation, see here:
typedef enum { IGRAPH_DEGSEQ_CONFIGURATION = 0, /* Configuration model, allowing non-simple graphs */
IGRAPH_DEGSEQ_VL, /* Viger-Latapy, generates simple connected graphs */
IGRAPH_DEGSEQ_FAST_HEUR_SIMPLE, /* Fast heuristic, generates simple graphs */
IGRAPH_DEGSEQ_CONFIGURATION_SIMPLE, /* Configuration model, generates simple graphs */
IGRAPH_DEGSEQ_EDGE_SWITCHING_SIMPLE, /* Edge-switching MCMC, generates simple graphs */
/* Deprecated, kept for backwards compatibility: */
IGRAPH_DEGSEQ_SIMPLE IGRAPH_DEPRECATED_ENUMVAL = IGRAPH_DEGSEQ_CONFIGURATION,
IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE IGRAPH_DEPRECATED_ENUMVAL = IGRAPH_DEGSEQ_FAST_HEUR_SIMPLE,
IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE_UNIFORM IGRAPH_DEPRECATED_ENUMVAL = IGRAPH_DEGSEQ_CONFIGURATION_SIMPLE
} igraph_degseq_t;
The issue to update the method names is here .