arXiv subjects

Andrea Somazzi

Publications and source records attributed to Andrea Somazzi.

5 recordsLinked to original sources

arXiv2026

Pregnancy as a dynamical paradox: robustness, control and birth onset

The timing of human labor is among the most critical determinants of neonatal survival, yet the mechanisms that govern the transition from uterine quiescence to coordinated contractions remain elusive. Here we present a dynamical-systems framework that models the pregnant uterus as a spatially extended network of electrically excitable cells regulated by sparse adaptive feedback mimicking hormonal and mechanical influences. This approach reveals how stability during gestation and sensitivity near parturition can be simultaneously maintained through the interplay of control, network structure, and noise. Our analysis shows that spontaneous contractions such as Braxton-Hicks and Alvarez waves are not epiphenomena, but functional components that reduce control effort and preserve responsiveness. Moreover, we identify preterm labor as a boundary-crossing phenomenon arising when control fails to correctly interpret early-warning signals. These results establish a unifying mechanistic theory for labor onset, yield testable predictions, and suggest new therapeutic strategies to mitigate preterm birth risk.

physics.bio-ph↗

arXiv2025

Generalized Maximum Entropy: When and Why you need it

The classical Maximum-Entropy Principle (MEP) based on Shannon entropy is widely used to construct least-biased probability distributions from partial information. However, the Shore-Johnson axioms that single out the Shannon functional hinge on strong system independence, an assumption often violated in real-world, strongly correlated systems. We provide a self-contained guide to when and why practitioners should abandon the Shannon form in favour of the one-parameter Uffink-Jizba-Korbel (UJK) family of generalized entropies. After reviewing the Shore and Johnson axioms from an applied perspective, we recall the most commonly used entropy functionals and locate them within the UJK family. The need for generalized entropies is made clear with two applications, one rooted in economics and the other in ecology. A simple mathematical model worked out in detail shows the power of generalized maximum entropy approaches in dealing with cases where strong system independence does not hold. We conclude with practical guidelines for choosing an entropy measure and reporting results so that analyses remain transparent and reproducible.

stat.ME↗

arXiv2023

Social media battle for attention: opinion dynamics on competing networks

In the age of information abundance, attention is a coveted resource. Social media platforms vigorously compete for users' engagement, influencing the evolution of their opinions on a variety of topics. With recommendation algorithms often accused of creating "filter bubbles", where like-minded individuals interact predominantly with one another, it's crucial to understand the consequences of this unregulated attention market. To address this, we present a model of opinion dynamics on a multiplex network. Each layer of the network represents a distinct social media platform, each with its unique characteristics. Users, as nodes in this network, share their opinions across platforms and decide how much time to allocate in each platform depending on its perceived quality. Our model reveals two key findings. i) When examining two platforms - one with a neutral recommendation algorithm and another with a homophily-based algorithm - we uncover that even if users spend the majority of their time on the neutral platform, opinion polarization can persist. ii) By allowing users to dynamically allocate their social energy across platforms in accordance to their homophilic preferences, a further segregation of individuals emerges. While network fragmentation is usually associated with "echo chambers", the emergent multi-platform segregation leads to an increase in users' satisfaction without the undesired increase in polarization. These results underscore the significance of acknowledging how individuals gather information from a multitude of sources. Furthermore, they emphasize that policy interventions on a single social media platform may yield limited impact.

physics.soc-ph↗

arXiv2023

On nonlinear compression costs: when Shannon meets Rényi

Shannon entropy is the shortest average codeword length a lossless compressor can achieve by encoding i.i.d. symbols. However, there are cases in which the objective is to minimize the \textit{exponential} average codeword length, i.e. when the cost of encoding/decoding scales exponentially with the length of codewords. The optimum is reached by all strategies that map each symbol $x_i$ generated with probability $p_i$ into a codeword of length $\ell^{(q)}_D(i)=-\log_D\frac{p_i^q}{\sum_{j=1}^Np_j^q}$. This leads to the minimum exponential average codeword length, which equals the Rényi, rather than Shannon, entropy of the source distribution. We generalize the established Arithmetic Coding (AC) compressor to this framework. We analytically show that our generalized algorithm provides an exponential average length which is arbitrarily close to the Rényi entropy, if the symbols to encode are i.i.d.. We then apply our algorithm to both simulated (i.i.d. generated) and real (a piece of Wikipedia text) datasets. While, as expected, we find that the application to i.i.d. data confirms our analytical results, we also find that, when applied to the real dataset (composed by highly correlated symbols), our algorithm is still able to significantly reduce the exponential average codeword length with respect to the classical `Shannonian' one. Moreover, we provide another justification of the use of the exponential average: namely, we show that by minimizing the exponential average length it is possible to minimize the probability that codewords exceed a certain threshold length. This relation relies on the connection between the exponential average and the cumulant generating function of the source distribution, which is in turn related to the probability of large deviations. We test and confirm our results again on both simulated and real datasets.

cs.IT↗

arXiv2023

Learn your entropy from informative data: an axiom ensuring the consistent identification of generalized entropies

Shannon entropy, a cornerstone of information theory, statistical physics and inference methods, is uniquely identified by the Shannon-Khinchin or Shore-Johnson axioms. Generalizations of Shannon entropy, motivated by the study of non-extensive or non-ergodic systems, relax some of these axioms and lead to entropy families indexed by certain `entropic' parameters. In general, the selection of these parameters requires pre-knowledge of the system or encounters inconsistencies. Here we introduce a simple axiom for any entropy family: namely, that no entropic parameter can be inferred from a completely uninformative (uniform) probability distribution. When applied to the Uffink-Jizba-Korbel and Hanel-Thurner entropies, the axiom selects only Rényi entropy as viable. It also extends consistency with the Maximum Likelihood principle, which can then be generalized to estimate the entropic parameter purely from data, as we confirm numerically. Remarkably, in a generalized maximum-entropy framework the axiom implies that the maximized log-likelihood always equals minus Shannon entropy, even if the inferred probability distribution maximizes a generalized entropy and not Shannon's, solving a series of problems encountered in previous approaches.

physics.data-an↗