Maximum Entropy
Hub

The hub of maximum-entropy null models
for network randomization

by Marzio di Vece 

Language: Python 3
Last update: May 2023
Networks: monopartite: directed, directed AND weighted
Null models: DBCM, RBCM, DBCM+CReMa, RBCM+CRWCM
Pypi: https://pypi.org/project/NuMeTriS/
Github:  https://github.com/MarsMDK/NuMeTriS
ReadTheDocs:  https://github.com/MarsMDK/NuMeTriS
Paper: Marzio di Vece, Frank Pijpers, Diego Garlaschelli, https://arxiv.org/abs/2305.12179
Notes: NuMeTriS is a package for Pattern Detection of the 13 triadic connected sub-graphs using maximum-entropy models with directed and reciprocated constraints on network data.

NuMeTriS:
NUll ModEls for TRIadic Structures

NuMeTriS is a package developed on python3 for Pattern Detection of the 13 triadic connected sub-graphs using maximum-entropy models using direected and reciprocated constraints on network data.

NuMeTriS provides solvers for the binary models DBCM and RBCM, and the conditional weighted models CReMa and CRWCM. All of these models are explained in [https://arxiv.org/abs/2305.12179]. The use of DBCM and CReMa enable the user to explicitly constrain network properties based on direction, such as out-degree, in-degree (binary) and out-strength and in-strength (weighted). In contrast, the use of RBCM and CRWCM enable the user to constrain network properties based on both direction and reciprocity, such as the reciprocated and non-reciprocated degrees and the reciprocated and non-reciprocated strengths.

Moreover, after solving the models it is possible to generate the related ensembles and compute triadic occurrences, the arithmetic mean of the weights on triadic structures (average fluxes) and their geometric mean (intensities). While triadic occurrences and fluxes are explained in [https://arxiv.org/abs/2305.12179], the triadic intensity is the geometric mean of the weights in triadic structures, as explained in [https://journals.aps.org/pre/abstract/10.1103/PhysRevE.71.065103] but here defined for all 13 sub-graphs.