Please use this identifier to cite or link to this item:
|Title:||A unifying framework for fast randomization of ecological networks with fixed (node) degrees|
|Authors:||CARSTENS JACOBIEN; BERGER ANNABELL; STRONA GIOVANNI|
|Citation:||METHODSX vol. 5 p. 773-780|
|Type:||Articles in periodicals and books|
|Abstract:||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).|
|JRC Directorate:||Sustainable Resources|
Files in This Item:
There are no files associated with this item.
Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.