Given an adjacency matrix for a graph,
permEdgesM2M will return an adjacency matrix after an Erdos-Renyi random permutation of the edges in the graph.
perNodesM2M will return an adjacency matrix for a graph with identical structure, but with the node labels permuted.
A square adjacency matrix for a graph.
A square adjacency matrix for the new graph, subject to a random permutation of the edges or nodes.
Balasubramanian, et al. (2004) A graph theoretic approach to integromics - integrating disparate sources of functional genomics data.
1 2 3 4
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.