arXiv subjects

Guido Caldarelli

Publications and source records attributed to Guido Caldarelli.

At least 19 recordsLinked to original sources

arXiv2026

Persistent currents in signed directed networks

Network theory can be fruitfully used to describe quantum coherence in physical systems. To that purpose we introduce persistent currents in signed directed networks by interpreting the signed magnetic Laplacian as an effective Hamiltonian and the associated edge phases as a discrete gauge field. In a canonical ensemble, persistent currents arise as thermodynamic responses to variations of gauge-invariant fluxes. We show that these fluxes are naturally defined on the cycle space of the network, and that the resulting currents are constrained to the divergence-free subspace and decompose onto independent cycles. This formulation provides a direct generalization of persistent currents from rings and lattices to arbitrary topologies. Detection of persistent currents provides a signature of the quantum phase coherence supported by the network, and a direct signature of the geometry of its cycle space. Such a mapping, not only allows a practical way to deal with quantum coherence for a variety of situations in the field of quantum technologies, but it also allows a physical interpretation of the importance of the Laplacian operator in graph theory, linking its role to the one of Hamiltonian (i.e. a tight-binding one) in physical systems. To test the power of the method, we construct a signed directed network that reproduces the Hofstadter butterfly spectrum.

cond-mat.dis-nn↗

arXiv2026

Network-based drug repurposing for MYH9-related nephritis

Using tools from network theory, we analyze the organization of a MYH9-oriented drug-like library in chemical space using a multi-descriptor framework. The dataset is drawn from ZINC, a publicly available database of commercially accessible compounds curated for virtual screening and drug discovery. Starting from 6004 molecules, preprocessing yields 5000 structurally valid and descriptor-complete compounds. Similarity is defined via Tanimoto distance on Morgan fingerprints and single-descriptor distances for xLogP, HBD, HBA, molecular weight, and rotatable bonds. For each representation, we construct k-nearest-neighbor networks and identify communities using the Louvain-Leiden algorithm. All networks exhibit highly significant modularity (Q=0.91-0.99) relative to degree-preserving null models, demonstrating pronounced nonrandom chemical organization across descriptors. Cross-descriptor robustness is quantified through a co-clustering matrix over 1.25 X 10^7 molecular pairs, measuring how consistently compound pairs co-occur within the same community across descriptor-specific networks. Although most pairs show limited agreement, a sparse high-consensus core emerges, highlighting the complementarity of the descriptors. Minimum spanning trees derived from structural and consensus similarities reveal distinct backbone topologies: a scaffold-driven, sparse structure versus a compact, hub-rich consensus network. Betweenness centrality on these backbones identifies compounds that are both structurally central and descriptor-balanced. These results provide a statistically validated network representation of chemical space and a principled strategy to extract consensus-stable compounds for downstream screening.

physics.bio-ph↗

arXiv2026

Phase Transitions in Neural Networks Pruning

Deep neural networks are strongly over-parameterized, often containing far more weights than required for their task. Although such redundancy can aid optimization, it leads to inefficient deployment and high computational cost, motivating model compression techniques. Among these, network pruning provides a clear and effective route to sparsity. We study pruning from a statistical-physics perspective, interpreting performance degradation under weight removal as a phase transition. Focusing on magnitude-based pruning with fine-tuning, we show that deep networks undergo a sharp transition from a cooperative, functional phase to a disordered phase with collapsed performance. This transition is characterized by scaling laws consistent with second-order critical behavior, with connectivity as the control parameter. Our findings suggest universal pruning-induced criticality across architectures and datasets. Finally, we show that there exists a large class of subnetworks sharing the same nodes' degrees with similar learning ability, thus linking model performance to its topological properties.

cond-mat.dis-nn↗

arXiv2026

Leveraging Content Producer Networks and User Perception to Detect Online Discursive Communities

Online discussions are often characterized by strong behavioral asymmetries: a relatively small fraction of users actively produces content, while the majority primarily consumes and redistributes it. Here we propose a community-detection framework for online social networks that exploits this asymmetry by first identifying and clustering a set of leading users, and then extending the resulting labels to the broader user base. We introduce two complementary strategies to cluster leaders, one based on their mutual interactions and the other on audience overlap, both relying on entropy-based filtering to separate signal from noise. We evaluate the framework on three major Italian political debates on Twitter/X, using public figures--identified through the pre-2022 verification system--as leaders, and known affiliations of political actors as ground truth labels. Compared with standard baselines, the proposed approach yields more coherent and interpretable communities aligned with political structures, with the two variants respectively recovering parties and coalitions. Activity-based criteria for selecting leaders produce qualitatively similar but consistently weaker results, particularly at the coalition level. Overall, our findings show that creating statistically validated networks of publicly recognized figures, whose off-platform roles constrain and stabilize their online behavior, provide a strong basis to identify discursive communities on social media. Although developed for Twitter/X, the approach is conceptually general, as it leverages structural asymmetries common to many online platforms.

cs.SI↗

arXiv2026

Block-Fitness Modeling of the Global Air Mobility Network

Accurate representations of the World Air Transportation Network (WAN) are fundamental inputs to models of global mobility, epidemic risk, and infrastructure planning. However, high-resolution, real-time data on the WAN are largely commercial and proprietary, therefore often inaccessible to the research community. Here we introduce a generative model of the WAN that treats air travel as a stochastic process within a maximum-entropy framework. The model uses airport-level passenger flows to probabilistically generate connections while preserving traffic volumes across geographic regions. The resulting reconstructed networks reproduce key structural properties of the WAN and enable simulations of dynamic spreading that closely match those obtained using the real network. Our approach provides a scalable, interpretable, and computationally efficient framework for forecasting and policy design in global mobility systems.

physics.soc-ph↗

arXiv2025

Bayesian Field Theory of the Rate Estimation

We address the statistical inference of a time-dependent rate of events in the framework of Bayesian field theory. This maps the problem to a Langevin equation which, beyond the local linear regime taken as reference, involves nonlinearities and an explicit dependence on the local shape of the maximum likelihood curve. We study the corresponding impacts in a perturbative expansion, formulating a scaling hypothesis for the order of shape corrections. We find that the pure nonlinearities dominate the mean and skewness. Crucially, we uncover that the leading correction to the variance is driven by noise propagation from the signal's effective curvature. We test the derived expansion with numerical simulations and illustrate its applicability on real neural spike data.

stat.ME↗

arXiv2025

Network theory classification of quantum matter based on wave function snapshots

Quantum computers and simulators offer unparalleled capabilities of probing quantum many-body states, by obtaining snapshots of the many-body wave function via collective projective measurements. The probability distribution obtained by such snapshots (which are fundamentally limited to a negligible fraction of the Hilbert space) is of fundamental importance to determine the power of quantum computations. However, its relation to many-body collective properties is poorly understood. Here, we develop a theoretical framework to link quantum phases of matter to their snapshots, based on a combination of data complexity and network theory analyses. The first step in our scheme consists of applying Occam's razor principle to quantum sampling: given snapshots of a wave function, we identify a minimal-complexity measurement basis by analyzing the information compressibility of snapshots over different measurement bases. The second step consists of analyzing arbitrary correlations using network theory, building a wave-function network from the minimal-complexity basis data. This approach allows us to stochastically classify the output of quantum computers and simulations, with no assumptions on the underlying dynamics, and in a fully interpretable manner. We apply this method to quantum states of matter in one-dimensional translational invariant systems, where such classification is exhaustive, and where it reveals an interesting interplay between algorithmic and computational complexity for many-body states. Our framework is of immediate experimental relevance, and can be further extended both in terms of more advanced network mathematics, including discrete homology, as well as in terms of applications to physical phenomena, such as time-dependent dynamics and gauge theories.

quant-ph↗

arXiv2025

The Physics of News, Rumors, and Opinions

The boundaries between physical and social networks have narrowed with the advent of the Internet and its pervasive platforms. This has given rise to a complex adaptive information ecosystem where individuals and machines compete for attention, leading to emergent collective phenomena. The flow of information in this ecosystem is often non-trivial and involves complex user strategies from the forging or strategic amplification of manipulative content to large-scale coordinated behavior that trigger misinformation cascades, echo-chamber reinforcement, and opinion polarization. We argue that statistical physics provides a suitable and necessary framework for analyzing the unfolding of these complex dynamics on socio-technological systems. This review systematically covers the foundational and applied aspects of this framework. The review is structured to first establish the theoretical foundation for analyzing these complex systems, examining both structural models of complex networks and physical models of social dynamics (e.g., epidemic and spin models). We then ground these concepts by describing the modern media ecosystem where these dynamics currently unfold, including a comparative analysis of platforms and the challenge of information disorders. The central sections proceed to apply this framework to two central phenomena: first, by analyzing the collective dynamics of information spreading, with a dedicated focus on the models, the main empirical insights, and the unique traits characterizing misinformation; and second, by reviewing current models of opinion dynamics, spanning discrete, continuous, and coevolutionary approaches. In summary, we review both empirical findings based on massive data analytics and theoretical advances, highlighting the valuable insights obtained from physics-based efforts to investigate these phenomena of high societal impact.

physics.soc-ph↗

arXiv2025

The quest for new materials: the network theory and machine learning perspectives

Understanding and predicting the emergence of novel materials is a fundamental challenge in condensed matter physics, materials science and technology. With the rapid growth of materials databases in both size and reliability, the challenge shifts from data collection to efficient exploration of this vast and complex space. A key strategy lies in a smart use of descriptors at multiple scales, ranging from atomic arrangements to macroscopic properties, to represent materials in high-dimensional abstract spaces. Network theory provides a powerful framework to structure and analyze these relationships, capturing hidden patterns and guiding discovery. Machine Learning complements this approach by enabling predictive modeling, dimensionality reduction, and the identification of promising material candidates. By integrating network-based methods with Machine Learning techniques, researchers can construct, analyze, and efficiently navigate the material space, uncovering novel materials with tailored properties. This review explores the synergy between network theory and ML, highlighting their role in accelerating materials discovery through a systematic and interpretable approach.

cond-mat.mtrl-sci↗

arXiv2024

Fibration symmetry-breaking supports functional transitions in a brain network engaged in language

In his book 'A Beautiful Question', physicist Frank Wilczek argues that symmetry is 'nature's deep design,' governing the behavior of the universe, from the smallest particles to the largest structures. While symmetry is a cornerstone of physics, it has not yet been found widespread applicability to describe biological systems, particularly the human brain. In this context, we study the human brain network engaged in language and explore the relationship between the structural connectivity (connectome or structural network) and the emergent synchronization of the mesoscopic regions of interest (functional network). We explain this relationship through a different kind of symmetry than physical symmetry, derived from the categorical notion of Grothendieck fibrations. This introduces a new understanding of the human brain by proposing a local symmetry theory of the connectome, which accounts for how the structure of the brain's network determines its coherent activity. Among the allowed patterns of structural connectivity, synchronization elicits different symmetry subsets according to the functional engagement of the brain. We show that the resting state is a particular realization of the cerebral synchronization pattern characterized by a fibration symmetry that is broken in the transition from rest to language. Our findings suggest that the brain's network symmetry at the local level determines its coherent function, and we can understand this relationship from theoretical principles.

q-bio.NC↗

arXiv2024

Laplacian Renormalization Group: An introduction to heterogeneous coarse-graining

The renormalization group (RG) constitutes a fundamental framework in modern theoretical physics. It allows the study of many systems showing states with large-scale correlations and their classification in a relatively small set of universality classes. RG is the most powerful tool for investigating organizational scales within dynamic systems. However, the application of RG techniques to complex networks has presented significant challenges, primarily due to the intricate interplay of correlations on multiple scales. Existing approaches have relied on hypotheses involving hidden geometries and based on embedding complex networks into hidden metric spaces. Here, we present a practical overview of the recently introduced Laplacian Renormalization Group for heterogeneous networks. First, we present a brief overview that justifies the use of the Laplacian as a natural extension for well-known field theories to analyze spatial disorder. We then draw an analogy to traditional real-space renormalization group procedures, explaining how the LRG generalizes the concept of "Kadanoff supernodes" as block nodes that span multiple scales. These supernodes help mitigate the effects of cross-scale correlations due to small-world properties. Additionally, we rigorously define the LRG procedure in momentum space in the spirit of Wilson RG. Finally, we show different analyses for the evolution of network properties along the LRG flow following structural changes when the network is properly reduced.

cond-mat.stat-mech↗

arXiv2024

Challenges and opportunities for digital twins in precision medicine: a complex systems perspective

The adoption of digital twins (DTs) in precision medicine is increasingly viable, propelled by extensive data collection and advancements in artificial intelligence (AI), alongside traditional biomedical methodologies. However, the reliance on black-box predictive models, which utilize large datasets, presents limitations that could impede the broader application of DTs in clinical settings. We argue that hypothesis-driven generative models, particularly multiscale modeling, are essential for boosting the clinical accuracy and relevance of DTs, thereby making a significant impact on healthcare innovation. This paper explores the transformative potential of DTs in healthcare, emphasizing their capability to simulate complex, interdependent biological processes across multiple scales. By integrating generative models with extensive datasets, we propose a scenario-based modeling approach that enables the exploration of diverse therapeutic strategies, thus supporting dynamic clinical decision-making. This method not only leverages advancements in data science and big data for improving disease treatment and prevention but also incorporates insights from complex systems and network science, quantitative biology, and digital medicine, promising substantial advancements in patient care.

physics.bio-ph↗

arXiv2024

Urban topology and dynamics can assess green areas importance

Green areas are a crucial element in evolution of a city, contributing to improve citizens' life, to reduce effects of climate change, and to make possible the survival of other species in urban areas. Unfortunately, the above effects are difficult to assess quantitatively for regulators, stakeholders and experts, making troublesome the planning of city development. Here we present a method to estimate the impact of these areas in the city life based on the network topology of the city itself and on a simple model of dynamics on this structure. Movements between various areas of the city are simulated by means of an agent-based biased-diffusion process where citizens try to reach the nearest Public Green Area (PGA) from their position and the model is fed with real data about the density of populations in the cases of study. Firstly, we define a centrality measure of PGA's based on average farness measured on the city network; this approach outperforms information based on the simple topology. We then improve this quantity by taking into account the occupation of PGA's, thereby providing a quantitative measure of PGA usage for regulators.

physics.soc-ph↗

arXiv2024

Evidence of scale-free clusters of vegetation in tropical rainforests

Tropical rainforests exhibit a rich repertoire of spatial patterns emerging from the intricate relationship between the microscopic interaction between species. In particular, the distribution of vegetation clusters can shed much light on the underlying process regulating the ecosystem. Analyzing the distribution of vegetation clusters at different resolution scales, we show the first robust evidence of scale-invariant clusters of vegetation, suggesting the coexistence of multiple intertwined scales in the collective dynamics of tropical rainforests. We use field data and computational simulations to confirm our hypothesis, proposing a predictor that could be particularly interesting to monitor the ecological resilience of the world's 'green lungs'.

cond-mat.stat-mech↗

arXiv2024

Network topology mapping of Chemical Compounds Space

We define bipartite and monopartite relational networks of chemical elements and compounds using two different datasets of inorganic chemical and material compounds, as well as study their topology. We discover that the connectivity between elements and compounds is distributed exponentially for materials, and with a fat tail for chemicals. Compounds networks show similar distribution of degrees, and feature a highly-connected club due to oxygen. Chemical compounds networks appear more modular than material ones, while the communities detected reveal different dominant elements specific to the topology. We successfully reproduce the connectivity of the empirical chemicals and materials networks by using a family of fitness models, where the fitness values are derived from the abundances of the elements in the aggregate compound data. Our results pave the way towards a relational network-based understanding of the inherent complexity of the vast chemical knowledge atlas, and our methodology can be applied to other systems with the ingredient-composite structure.

cond-mat.stat-mech↗

arXiv2023

Systemic risk measured by systems resiliency to initial shocks

The study of systemic risk is often presented through the analysis of several measures referring to quantities used by practitioners and policy makers. Almost invariably, those measures evaluate the size of the impact that exogenous events can exhibit on a financial system without analysing the nature of initial shock. Here we present a symmetric approach and propose a set of measures that are based on the amount of exogenous shock that can be absorbed by the system before it starts to deteriorate. For this purpose, we use a linearized version of DebtRank that allows to clearly show the onset of financial distress towards a correct systemic risk estimation. We show how we can explicitly compute localized and uniform exogenous shocks and explained their behavior though spectral graph theory. We also extend analysis to heterogeneous shocks that have to be computed by means of Monte Carlo simulations. We believe that our approach is more general and natural and allows to express in a standard way the failure risk in financial systems.

physics.soc-ph↗

arXiv2022

Network analysis of a complex disease: the gut microbiota in the inflammatory bowel disease case

Inflammatory bowel diseases (IBD) are complex diseases in which the gut microbiota is attacked by the immune system of genetically predisposed subjects when they are exposed to yet unclear environmental factors. The complexity of this class of diseases makes them suitable to be represented and studied with network science. In the project, the metagenomic data of the gut microbiota of control, Crohn's disease, and ulcerative colitis subjects were divided in three ranges (prevalent, common, uncommon). Then, correlation networks and co-expression networks were used to represent this data. The former networks involved the calculation of the Pearson's correlation and the use of the percolation threshold to binarize the adjacency matrix, whereas the latter involved the construction of the bipartite networks and the monopartite projection after binarization of the biadjacency matrix. Then, centrality measures and community detection were used on the so-built networks. The main results obtained were about the modules of "Bacteroides", which were connected in control subjects' correlation network, "Faecalibacterium prausnitzii", where co-enzyme A became central in IBD correlation networks and "Escherichia coli", which module has different position in the different diagnoses networks.

q-bio.QM↗

arXiv2022

Dimensional Reduction of Solvency Contagion Dynamics on Financial Networks

Modelling systems with networks has been a powerful approach to tame the complexity of several phenomena. Unfortunately, such an approach is often made difficult by the large number of variables to take into consideration. Methods of dimensional reduction are useful tools to rescale a complex dynamical network down to a low-dimensional effective system and thus to capture the global features of the dynamics. Here we study the application of the degree-weighted and spectral reduction methods to an important class of dynamical processes on networks: the propagation of credit shocks within an interbank network, modelled according to the DebtRank algorithm. In particular we introduce an effective version of the dynamics, characterised by functions with continuous derivatives that can be handled by the dimensional reduction. We test the reduction methods against the full dynamical system in different interbank market settings: homogeneous and heterogeneous networks generated from state-of-the-art reconstruction methods as well as networks derived from empirical e-MID data. Our results indicate that, for proper choices of the bank default probability, reduction methods are able to provide reliable estimates of systemic risk in the market, with the spectral reduction better handling heterogeneous networks. Finally we provide new physical insights on the nature and working principles of dimensional reduction methods.

physics.soc-ph↗