Formula: attach half-edges (stubs) uniformly at random in pairs; every vertex ends with its requested degree
Value
List with edges, degree (realised), self_loops, multi_edges, n.
List with edges, degree (realised), self_loops, multi_edges, n.
References
Bender and Canfield (1978), The asymptotic number of labeled graphs with given degree sequences, JCTA 24:296-307; Molloy and Reed (1995), A critical point for random graphs with a given degree sequence, Random Structures and Algorithms 6:161-180. Uniform stub pairing is the standard published construction.
Examples
V <- c(1, 2, 3, 4, 5, 6, 7, 8)
Configmodel(V)
#> $edges
#> ea eb
#> [1,] 0 2
#> [2,] 6 7
#> [3,] 3 7
#> [4,] 4 5
#> [5,] 4 6
#> [6,] 2 6
#> [7,] 5 7
#> [8,] 5 6
#> [9,] 7 7
#> [10,] 6 7
#> [11,] 3 4
#> [12,] 5 7
#> [13,] 6 7
#> [14,] 1 5
#> [15,] 3 6
#> [16,] 3 5
#> [17,] 2 4
#> [18,] 1 4
#>
#> $degree
#> [1] 1 2 3 4 5 6 7 8
#>
#> $self_loops
#> [1] 1
#>
#> $multi_edges
#> [1] 3
#>
#> $n
#> [1] 8
#>
#> $method
#> [1] "Configuration model (uniform stub pairing)"
#>
#> attr(,"class")
#> [1] "morie_rich_result" "list"