Related Experiment Video
Updated: May 21, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Unbiased degree-preserving randomization of directed binary networks
1Department of Mathematics, King's College London, The Strand, London, United Kingdom.
Abstract:
Randomizing 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 Markov chain with nontrivial acceptance probabilities for directed graphs, which converges to a strictly uniform measure and is based on edge swaps that conserve all in and out degrees. The acceptance probabilities can also be generalized to define Markov chains that target any alternative desired measure on the space of directed graphs in order to generate graphs with more sophisticated topological features. This is demonstrated by defining a process tailored to the production of directed graphs with specified degree-degree correlation functions. The theory is implemented numerically and tested on synthetic and biological network examples.
Related Concept Videos
Randomized Experiments
Simple randomization
Simple...
Bias
In statistics, a sampling bias is created when a sample is collected from a population, and some members of the population are not as likely to be chosen as others (remember, each member...
Wald-Wolfowitz Runs Test I
The test works...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...