Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. A key requirement is that the sampling process is unbiased and efficient. This software package samples and/or randomizes networks according to an unbiased maximum-entropy method. It addresses the solution of the maximum-entropy problem for seven null-models according to different constraints and input-data.
MAX&SAM Routine by Rossana Mastrandrea (Matlab required)