The Curveball algorithm is an efficient and unbiased procedure for randomizing bipartite networks (or their matrix counterpart) while preserving node degrees. Here we introduce two extensions of the procedure, making it capable to randomize also unimode directed and undirected networks. We provide formal mathematical proofs that the two extensions, as the original Curveball, are fast and unbiased (i.e. they sample uniformly from the universe of possible network configurations).
CARSTENS Jacobien;
BERGER Annabell;
STRONA Giovanni;
2019-10-25
ELSEVIER BV
JRC112418
2215-0161 (online),
https://www.sciencedirect.com/science/article/pii/S2215016118301067,
https://publications.jrc.ec.europa.eu/repository/handle/JRC112418,
10.1016/j.mex.2018.06.018 (online),
This document is only visible at the Commission level.
You are not authorized to publish or distribute it outside the European Commission.
This is a public document. You can share this publication.
Additional supporting files
| File name | Description | File type | |
|---|
