Currently there is a single randomization algorithm implemented Degree Preserving Edge Shuffle.
In this algorithm, edges are shuffled in an existing network but the in and out degree of each node remains the same.
The algorithm works as follows:
- A random edge (u,v) is selected from the network.
- A second random edge (s,t) is selected with the constraints that:
- u ≠ v ≠ s ≠ t
- (u,t) and (s,v) do not already exist in the network
- Edges (u,v) and (s,t) are removed and edges (u,t) and (s,v) are inserted into the network.
- Repeat steps 1-3 t times.
|
|