Unbiased degree-preserving randomisation of directed binary networks

E. S. Roberts, A. C. C. Coolen

Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance…