Description Usage Arguments Value Author(s) References See Also Examples

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.

1 2 | ```
permEdgesM2M(mat)
permNodesM2M(mat)
``` |

`mat` |
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.

Denise Scholtens

Balasubramanian, et al. (2004) A graph theoretic approach to integromics - integrating disparate sources of functional genomics data.

1 2 3 4 | ```
g <- matrix(c(0,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0),nrow=4)
g1 <- permEdgesM2M(g)
g2 <- permNodesM2M(g)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.