Unbiased degree-preserving randomisation of directed binary networks

Details Unbiased degree-preserving randomisation of directed binary networks Unbiased degree-preserving randomisation of directed binary networks

2011-12-20

arxiv.org/abs/1112.4677v1

Biology

Quantitative Biology

Quantitative Methods

14 pages, 10 figures, submitted to Phys. Rev. E

Scientific paper

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 Markov chain with non-trivial 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.

Affiliated with

Also associated with

No associations

Rating

Unbiased degree-preserving randomisation of directed binary networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unbiased degree-preserving randomisation of directed binary networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unbiased degree-preserving randomisation of directed binary networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56296