keeping_degseq: Graph rewiring while preserving the degree distribution

In igraph: Network Analysis and Visualization

Graph rewiring while preserving the degree distribution

Description

This function can be used together with rewire() to randomly rewire the edges while preserving the original graph's degree distribution.

Usage

keeping_degseq(loops = FALSE, niter = 100)

Arguments

loops	Whether to allow destroying and creating loop edges.
niter	Number of rewiring trials to perform.

Details

The rewiring algorithm chooses two arbitrary edges in each step ((a,b) and (c,d)) and substitutes them with (a,d) and (c,b), if they not already exists in the graph. The algorithm does not create multiple edges.

Author(s)

Tamas Nepusz [e-mail] and Gabor Csardi [e-mail]

See Also

sample_degseq()

Other rewiring functions: each_edge(), rewire()

Examples

g <- make_ring(10)
g %>%
  rewire(keeping_degseq(niter = 20)) %>%
  degree()
print_all(rewire(g, with = keeping_degseq(niter = vcount(g) * 10)))

igraph documentation built on Oct. 20, 2024, 1:06 a.m.