A unifying framework for fast randomization of ecological networks with fixed (node) degrees
Combinatorics
2018-07-27 v3 Data Structures and Algorithms
Abstract
The switching model is a Markov chain approach to sample graphs with fixed degree sequence uniformly at random. The recently invented Curveball algorithm for bipartite graphs applies several switches simultaneously (`trades'). Here, we introduce Curveball algorithms for simple (un)directed graphs which use single or simultaneous trades. We show experimentally that these algorithms converge magnitudes faster than the corresponding switching models.
Cite
@article{arxiv.1609.05137,
title = {A unifying framework for fast randomization of ecological networks with fixed (node) degrees},
author = {Corrie Jacobien Carstens and Annabell Berger and Giovanni Strona},
journal= {arXiv preprint arXiv:1609.05137},
year = {2018}
}