Closed dhimmel closed 7 years ago
Recording here our recent discussion online: there is no benefit to be gained from converting a graph to a matrix for the purposes of this edge swapping operation
there is no benefit to be gained from converting a graph to a matrix for the purposes of this edge swapping operation
Good to know. Will close this issue.
In, the past, we've permuted hetnets via the hetio package. We have also explored a Cypher implementation. The method we use is called XSwap as described in:
XSwap randomly selects pairs of edges and attempts to switch the endpoints. The result is a network with degree preserved but relationships randomized. To extend this concept to hetnets, we separately permute each relationship. So I think we could implement hetnet permutation on the adjacency matrices. This may be a bit faster than the hetio implementation.
I believe this paper describes the edge swap technique for matrices:
Anyways, @kkloste do you think there's an easy matrix implementation of XSwap?
See also (related literature):