'SIMONA' software package released!

The software package SIMONA (an acronym standing for SIgned MOdels for Network Analysis) is designed to solve maximum-entropy models for signed networks and generate the related ensembles.

Published in Social Sciences and Physics

Like

Share this post

Choose a social network to share with, or copy the URL to share elsewhere

This is a representation of how your post may appear on social media. The actual post will vary between social networks
Sampling random graphs with given properties is crucial for network analysis, as they represent benchmarks against which empirical observations must be compared for detecting the fundamental patterns shaping real-world networks. Microcanonical implementations of signed null models, which generate graphs that strictly adhere to the specified constraints, are prone to biases and inefficiencies. To avoid these limitations, here we consider the exact canonical framework induced by Shannon entropy maximization, ensuring that the enforced constraints are realized on average.

More specifically, we consider graphs whose edges are associated with a +1, a -1 or a 0 and propose an iterative method to correctly sample a set of four ensembles of signed networks, i.e. those associated with both the free-topology and the fixed-topology versions of the Random Graph Model and the Configuration Model: in the former case, signs are shuffled along with the edges while, in the latter, signs are permuted on a set of connections that, instead, are kept fixed. In words, the benchmarks belonging to the first basket are designed to model situations where agents can choose both with whom and how to interact while the benchmarks belonging to the second basket are designed to model situations where agents can solely choose how to interact. Since our approach relies upon exact maximum-entropy distributions, it is inherently unbiased, even for highly heterogeneous networks.

The binary, undirected, signed models implemented by the present package are introduced and solved in the paper by Gallo, Garlaschelli, Lambiotte, Saracco, Squartini "Testing structural balance theories in heterogeneous signed networks" Comm. Phys. 7, 154 (2024) a summary of which can be found here. For what concerns the theoretical methodology lying at the basis of the entropy-based canonical models, see the paper by Park and Newman "Statistical mechanics of networks" Phys. Rev. E 70, 66117 (2004) and the paper by Squartini and Garlaschelli "Analytical maximum-likelihood method to detect patterns in real networks" New J. Phys. 13, 083001 (2011).

Please sign in or register for FREE

If you are a registered user on Research Communities by Springer Nature, please sign in

Follow the Topic

Complex Networks
Physical Sciences > Physics and Astronomy > Theoretical, Mathematical and Computational Physics > Complex Systems > Complex Networks
Social Theory
Humanities and Social Sciences > Society > Sociology > Social Theory

Related Collections

With Collections, you can get published faster and increase your visibility.

Higher-order interaction networks 2024

This Collection brings together the latest and most important findings on higher-order interaction networks, which we believe will become an important reference for physicists working on the topic.

Publishing Model: Open Access

Deadline: Feb 28, 2026

Non-Markovian quantum dynamics in physical systems: description and control

This collection aims to gather the latest approaches to characterize and quantify quantum non-Markovianity and to exploit it in practical applications

Publishing Model: Open Access

Deadline: Dec 31, 2025