Generalize "probabilistic" random graph generation/rewiring to a blockmodel
This implements a general "blockmodel" generation / rewiring algorithm, using Gibbs acceptence / rejection sampling (a.k.a Metropolis-Hastings). This also implements some optimizations in the rewiring code, which makes it more efficient on filtered graphs.
Showing
This diff is collapsed.