Downloadable Files

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)
Shuffled Louvain (Python) by Mika J. Straka


ċ
BiCM_undirected.m
(6k)
Fabio Saracco,
Apr 22, 2016, 8:35 AM
ċ
TimeSeries_40Subjects_AAL116ROIs.zip
(3130k)
Rossana Mastrandrea,
Apr 10, 2017, 6:46 AM