IndeCut & related degree-preserving perm methods

refs #1 (comment)
greenelab · Nov 5, 2023 · 887eb1a · 887eb1a
1 parent 2ac0d6c
commit 887eb1a
Showing 1 changed file with 8 additions and 0 deletions.
diff --git a/content/02.body.md b/content/02.body.md
@@ -76,6 +76,14 @@ We use network permutation to isolate degree and determine its effects in differ
 Degree-preserving network permutation obscures true connections and higher-order connectivity information (e.g., community structure), while retaining node degree, and, thereby, the network's degree sequence.
 Thanks to the flexibility of permutation, our framework can quantify the effect of degree on any network edge prediction method.
 
+Several degree-preserving network permutation strategies have been developed including
+XSwap [@doi:10.1137/1.9781611972795.67],
+FANMOD (Fast Network Motif Detection) [@doi:10.1093/bioinformatics/btl038],
+CoMoFinder (Co-regulatory Motif Finder) [@doi:10.1093/bioinformatics/btv159],
+DIA-MCIS (Diaconis Monte Carlo Importance Sampling) [@doi:10.1093/bioinformatics/btm454],
+and WaRSwap (Weighted and Reverse Swap Sampling) [@doi:10.1186/gb-2013-14-8-r85].
+IndeCut proposed a method to characterize these strategies by their ability to uniformly sample from the solution space of all possible degree-preserving permutations [@doi:10.1093/bioinformatics/btx798].
+
 ### XSwap algorithm
 
 Hanhijärvi, et al. presented XSwap [@doi:10.1137/1.9781611972795.67], an algorithm for the randomization ("permutation") of unweighted networks (Figure {@fig:algo}A).