Skip to content

Commit

Permalink
IndeCut & related degree-preserving perm methods
Browse files Browse the repository at this point in the history
  • Loading branch information
dhimmel committed Nov 6, 2023
1 parent a211057 commit 5701a62
Showing 1 changed file with 8 additions and 0 deletions.
8 changes: 8 additions & 0 deletions content/02.body.md
Original file line number Diff line number Diff line change
Expand Up @@ -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).
Expand Down

0 comments on commit 5701a62

Please sign in to comment.