Description Usage Arguments Value Examples
View source: R/bipartite_edge_swap3.R
Run the edge swapping algorithm from Milo et al. (2003) on a bipartite graph while maintaining the separation of the nodes in two groups.
1 2 | bipartite_edge_swap3(gr, Q = 20, N = igraph::ecount(gr) * Q,
quiet = TRUE)
|
gr |
a tidygraph object with a node attribute called |
Q |
number of permutations you are conducting; default is 20 |
N |
the number of edge swaps; default is Q \times |E(G)| |
quiet |
boolean for if you want the number of successful edge swaps
printed; default |
the graph with N random edge swaps with constrained marginals
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.