From 5701a6208695a6293883ee2c6e65c2d1eda809e3 Mon Sep 17 00:00:00 2001 From: Daniel Himmelstein Date: Sun, 5 Nov 2023 08:39:48 -0500 Subject: [PATCH] IndeCut & related degree-preserving perm methods refs https://github.com/greenelab/xswap-manuscript/issues/1#issuecomment-1753658442 --- content/02.body.md | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/content/02.body.md b/content/02.body.md index af06487..addfd62 100644 --- 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).