perms                package:GraphAT                R Documentation

_R_a_n_d_o_m_l_y _p_e_r_m_u_t_e _e_d_g_e_s _o_r _n_o_d_e _l_a_b_e_l_s _i_n _a _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     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.

_U_s_a_g_e:

     permEdgesM2M(mat)
     permNodesM2M(mat)

_A_r_g_u_m_e_n_t_s:

     mat: A square adjacency matrix for a graph.

_V_a_l_u_e:

     A square adjacency matrix for the new graph, subject to a random
     permutation of the edges or nodes.

_A_u_t_h_o_r(_s):

     Denise Scholtens

_R_e_f_e_r_e_n_c_e_s:

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

_S_e_e _A_l_s_o:

     'permPower'

_E_x_a_m_p_l_e_s:

     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)

