2012
DOI: 10.1103/physreve.85.046103
|View full text |Cite
|
Sign up to set email alerts
|

Unbiased degree-preserving randomization of directed binary networks

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 gr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
73
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 48 publications
(73 citation statements)
references
References 30 publications
(84 reference statements)
0
73
0
Order By: Relevance
“…the Reciprocated Configuration Model (RCM) [28,32]. A first way of implementing a null model is computational [30,33]. For instance, in the CM and DCM, one starts with the original network and randomizes it through the iteration of some fundamental rewiring move that alters the topology but keeps the (in-and out-) degrees of all vertices fixed [30].…”
Section: A Measuring Global Spatial Effectsmentioning
confidence: 99%
See 1 more Smart Citation
“…the Reciprocated Configuration Model (RCM) [28,32]. A first way of implementing a null model is computational [30,33]. For instance, in the CM and DCM, one starts with the original network and randomizes it through the iteration of some fundamental rewiring move that alters the topology but keeps the (in-and out-) degrees of all vertices fixed [30].…”
Section: A Measuring Global Spatial Effectsmentioning
confidence: 99%
“…For instance, in the CM and DCM, one starts with the original network and randomizes it through the iteration of some fundamental rewiring move that alters the topology but keeps the (in-and out-) degrees of all vertices fixed [30]. As found recently [33], this approach produces biased results unless one uses a careful (but difficult to implement) acceptance probability of the attempted rewiring moves. Even with the correct acceptance probability, this approach is extremely time consuming since many iterations are necessary in order to produce a single randomized network, and many such randomized network variants are needed in order to sample the microcanonical ensemble of random graphs with degree sequence exactly equal to the observed one.…”
Section: A Measuring Global Spatial Effectsmentioning
confidence: 99%
“…The Maslov-Sneppen method might be biased in dense networks because there are no degrees of freedom for reshuffling (Roberts and Coolen, 2012). Given that we selected a balanced cross-section, the pool of trading world countries was notably reduced.…”
Section: Predicting the Architecture: Null Versus Gravity Modelmentioning
confidence: 99%
“…As a null model we now consider a random network characterized by a strength distribution equal to the one observed empirically for each time period (see (46) and references therein). For directed and weighted representations we can construct a randomization using the edge swap procedure (that now conserves the vertex in-out strength sequence but not the in-out degree sequence) in the following way.…”
Section: 21mentioning
confidence: 99%