2018
DOI: 10.1016/j.mex.2018.06.018
|View full text |Cite
|
Sign up to set email alerts
|

A unifying framework for fast randomization of ecological networks with fixed (node) degrees

Abstract: Graphical abstract

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 42 publications
0
12
0
1
Order By: Relevance
“…The purpose of this second randomisation is to test what motifs found in the first randomisation remain significant if the proportion of links within the regulatory set and their degrees are fixed, hence highlighting their importance in regulation. This randomisation was implemented following an extension of the curveball algorithm for directed networks (Carstens et al ., 2018). We verified that 10 5 steps of the algorithm were sufficient to ensure an unbiased search.…”
Section: Methodsmentioning
confidence: 99%
“…The purpose of this second randomisation is to test what motifs found in the first randomisation remain significant if the proportion of links within the regulatory set and their degrees are fixed, hence highlighting their importance in regulation. This randomisation was implemented following an extension of the curveball algorithm for directed networks (Carstens et al ., 2018). We verified that 10 5 steps of the algorithm were sufficient to ensure an unbiased search.…”
Section: Methodsmentioning
confidence: 99%
“…Curveball is a novel approach that instead considers the whole neighborhoods of randomly drawn node pairs. Its Markov chain converges to a uniform distribution, and experiments suggest that it requires less steps than the established ES [47]. Since trades however are more expensive, we study Curveball's practical runtime by introducing the first e icient Curveball algorithms: the I/O-e icient EM-CB for simple undirected graphs and its internal memory pendant IM CB.…”
Section: Discussionmentioning
confidence: 99%
“…Similarly to techniques of [47,48], our proof of Theorem 3.5 requires a small positive probability that any global switch collapses into a single switch. We implement this by independently rejecting each switch with probability P L .…”
Section: Global Edge Switching Markov Chain (G-es-mc)mentioning
confidence: 99%
See 1 more Smart Citation
“…There are several methods to reorganize them without altering row and column totals. One of these approaches is the so-called Curveball algorithm, published in [25,26,82]. We can use this algorithm as follows (exemplified by Fig.…”
Section: Sa With Curveball Algorithmmentioning
confidence: 99%