arXiv subjects

Giulio Cimini

Publications and source records attributed to Giulio Cimini.

At least 37 records · Page 2Linked to original sources

arXiv2024

Pattern-detection in the global automotive industry: a manufacturer-supplier-product network analysis

Production networks arise from supply and customer relations among firms. These systems are gaining growing attention as a consequence of disruptions due to natural or man-made disasters that happened in the last years, such as the Covid-19 pandemic or the Russia-Ukraine war. However, data constraints force the few, available studies to consider only country-specific production networks. In order to fully capture the cross-country structure of modern supply chains, here we focus on the global automotive industry as represented by the MarkLines Automotive dataset. After representing this data as a network of manufacturers, suppliers, and products, we perform a pattern-detection exercise using a statistically grounded validation technique based on the maximum entropy principle. We reveal the presence of a significantly large number of V-shaped and square-shaped motifs, indicating that manufacturing firms compete and are seldom engaged in a buyer-supplier relationship, while they typically have many suppliers in common. Interestingly, generalist and specialist suppliers coexist in the network. Additionally, we unveil the presence of geographical patterns, with manufacturers clustering around groups of suppliers; for instance, Chinese firms constitute a disconnected community, likely an effect of the protectionist policies promoted by the Chinese government. We also show the tendency of suppliers to organize their production by targeting specific functional modules of a vehicle. Besides shedding light on the self-organising principles shaping production networks, our findings open up the possibility of designing realistic generative models of supply chains, to be used for testing the resilience of the interconnected global economy.

physics.soc-ph↗

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

Spontaneous Opinion Swings in the Voter Model with Latency

The cognitive process of opinion formation is often characterized by stubbornness or resistance of agents to changes of opinion. To capture such a feature we introduce a constant latency time in the standard voter model of opinion dynamics: after switching opinion, an agent must keep it for a while. This seemingly simple modification drastically changes the stochastic diffusive behavior of the original model, leading to deterministic dynamical oscillations in the average opinion of the agents. We explain the origin of the oscillations and develop a mathematical formulation of the dynamics that is confirmed by extensive numerical simulations. We further characterize the rich phase space of the model and its asymptotic behavior. Our work offers insights into understanding and modeling opinion swings in diverse social contexts.

physics.soc-ph↗

arXiv2022

Multiplex mobility network and metapopulation epidemic simulations of Italy based on Open Data

The patterns of human mobility play a key role in the spreading of infectious diseases and thus represent a key ingredient of epidemic modeling and forecasting. Unfortunately, as the Covid-19 pandemic has dramatically highlighted, for the vast majority of countries there is no availability of granular mobility data. This hinders the possibility of developing computational frameworks to monitor the evolution of the disease and to adopt timely and adequate prevention policies. Here we show how this problem can be addressed in the case study of Italy. We build a multiplex mobility network based solely on open data, and implement a SIR metapopulation model that allows scenario analysis through data-driven stochastic simulations. The mobility flows that we estimate are in agreement with real-time proprietary data from smartphones. Our modeling approach can thus be useful in contexts where high-resolution mobility data is not available.

physics.soc-ph↗

arXiv2022

Self-induced consensus of Reddit users to characterise the GameStop short squeeze

The short squeeze of GameStop (GME) shares in mid-January 2021 has been primarily orchestrated by retail investors of the Reddit r/wallstreetbets community. As such, it represents a paramount example of collective coordination action on social media, resulting in large-scale consensus formation and significant market impact. In this work we characterise the structure and time evolution of Reddit conversation data, showing that the occurrence and sentiment of GME-related comments (representing how much users are engaged with GME) increased significantly much before the short squeeze actually took place. Taking inspiration from these early warnings as well as evidence from previous literature, we introduce a model of opinion dynamics where user engagement can trigger a self-reinforcing mechanism leading to the emergence of consensus, which in this particular case is associated to the success of the short squeeze operation. Analytical solutions and model simulations on interaction networks of Reddit users feature a phase transition from heterogeneous to homogeneous opinions as engagement grows, which we qualitatively compare to the sudden hike of GME stock price. Although the model cannot be validated with available data, it offers a possible and minimal interpretation for the increasingly important phenomenon of self-organized collective actions taking place on social networks.

physics.soc-ph↗

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↗

arXiv2022

The Evolution of Competitiveness across Economic, Innovation and Knowledge production activities

The evolution of economic and innovation systems at the national scale is shaped by a complex dynamics, the footprint of which is the nested structure of the activities in which different countries are competitive. Nestedness is a persistent feature across multiple kinds (layers) of activities related to the production of knowledge and goods: scientific research, technological innovation, industrial production and trade. We observe that in the layers of innovation and trade the competitiveness of countries correlates unambiguously with their diversification, while the science layer displays some peculiar feature. The evolution of scientific domains leads to an increasingly modular structure, in which the most developed nations become less competitive in the less advanced scientific domains, where they are replaced by the emerging countries. This observation is in line with a capability-based view of the evolution of economic systems, but with a slight twist. Indeed, while the accumulation of specific know-how and skills is a fundamental step towards development, resource constraints force countries to acquire competitiveness in the more complex research fields at the price of losing ground in more basic, albeit less visible (or more crowded), fields. This tendency towards a relatively specialized basket of capabilities leads to a trade-off between the need to diversify in order to evolve and the need to allocate resources efficiently. Collaborative patterns among developed nations reduce the necessity to be competitive in the less sophisticated fields, freeing resources for the more complex domains.

econ.GN↗

arXiv2022

Meta-validation of bipartite network projections

Monopartite projections of bipartite networks are useful tools for modeling indirect interactions in complex systems. The standard approach to identify significant links is statistical validation using a suitable null network model, such as the popular configuration model (CM) that constrains node degrees and randomizes everything else. However different CM formulations exist, depending on how the constraints are imposed and for which sets of nodes. Here we systematically investigate the application of these formulations in validating the same network, showing that they lead to different results even when the same significance threshold is used. Instead a much better agreement is obtained for the same density of validated links. We thus propose a meta-validation approach that allows to identify model-specific significance thresholds for which the signal is strongest, and at the same time to obtain results independent of the way in which the null hypothesis is formulated. We illustrate this procedure using data on scientific production of world countries.

physics.soc-ph↗

arXiv2021

Geography of Science: Competitiveness and Inequality

Using ideas and tools of complexity science we design a holistic measure of \textit{Scientific Fitness}, encompassing the scientific knowledge, capabilities and competitiveness of a research system. We characterize the temporal dynamics of Scientific Fitness and R\&D expenditures at the geographical scale of nations, highlighting patterns of similar research systems, and showing how developing nations (China in particular) are quickly catching up the developed ones. Down-scaling the aggregation level of the analysis, we find that even developed nations show a considerable level of inequality in the Scientific Fitness of their internal regions. Further, we assess comparatively how the competitiveness of each geographic region is distributed over the spectrum of research sectors. Overall, the Scientific Fitness represents the first high quality estimation of the scientific strength of nations and regions, opening new policy-making applications for better allocating resources, filling inequality gaps and ultimately promoting innovation.

cs.DL↗

arXiv2021

Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints

Exponential Random Graph Models (ERGMs) have gained increasing popularity over the years. Rooted into statistical physics, the ERGMs framework has been successfully employed for reconstructing networks, detecting statistically significant patterns in graphs, counting networked configurations with given properties. From a technical point of view, the ERGMs workflow is defined by two subsequent optimization steps: the first one concerns the maximization of Shannon entropy and leads to identify the functional form of the ensemble probability distribution that is maximally non-committal with respect to the missing information; the second one concerns the maximization of the likelihood function induced by this probability distribution and leads to its numerical determination. This second step translates into the resolution of a system of $O(N)$ non-linear, coupled equations (with $N$ being the total number of nodes of the network under analysis), a problem that is affected by three main issues, i.e. accuracy, speed and scalability. The present paper aims at addressing these problems by comparing the performance of three algorithms (i.e. Newton's method, a quasi-Newton method and a recently-proposed fixed-point recipe) in solving several ERGMs, defined by binary and weighted constraints in both a directed and an undirected fashion. While Newton's method performs best for relatively little networks, the fixed-point recipe is to be preferred when large configurations are considered, as it ensures convergence to the solution within seconds for networks with hundreds of thousands of nodes (e.g. the Internet, Bitcoin). We attach to the paper a Python code implementing the three aforementioned algorithms on all the ERGMs considered in the present work.

physics.data-an↗

arXiv2021

The Physics of Financial Networks

The field of Financial Networks is a paramount example of the novel applications of Statistical Physics that have made possible by the present data revolution. As the total value of the global financial market has vastly outgrown the value of the real economy, financial institutions on this planet have created a web of interactions whose size and topology calls for a quantitative analysis by means of Complex Networks. Financial Networks are not only a playground for the use of basic tools of statistical physics as ensemble representation and entropy maximization; rather, their particular dynamics and evolution triggered theoretical advancements as the definition of DebtRank to measure the impact and diffusion of shocks in the whole systems. In this review we present the state of the art in this field, starting from the different definitions of financial networks (based either on loans, on assets ownership, on contracts involving several parties -- such as credit default swaps, to multiplex representation when firms are introduced in the game and a link with real economy is drawn) and then discussing the various dynamics of financial contagion as well as applications in financial network inference and validation. We believe that this analysis is particularly timely since financial stability as well as recent innovations in climate finance, once properly analysed and understood in terms of complex network theory, can play a pivotal role in the transformation of our society towards a more sustainable world.

physics.soc-ph↗

arXiv2021

Reconstructing networks

Complex networks datasets often come with the problem of missing information: interactions data that have not been measured or discovered, may be affected by errors, or are simply hidden because of privacy issues. This Element provides an overview of the ideas, methods and techniques to deal with this problem and that together define the field of network reconstruction. Given the extent of the subject, we shall focus on the inference methods rooted in statistical physics and information theory. The discussion will be organized according to the different scales of the reconstruction task, that is, whether the goal is to reconstruct the macroscopic structure of the network, to infer its mesoscale properties, or to predict the individual microscopic connections.

physics.soc-ph↗

arXiv2020

Co-evolution between Codon Usage and Protein-Protein Interaction in Bacteria

We study the correlation between the codon usage bias of genetic sequences and the network features of protein-protein interaction (PPI) in bacterial species. We use PCA techniques in the space of codon bias indices to show that genes with similar patterns of codon usage have a significantly higher probability that their encoded proteins are functionally connected and interacting. Importantly, this signal emerges when multiple aspects of codon bias are taken into account at the same time. The present study extends our previous observations on E.Coli over a wide set of 34 bacteria. These findings could allow for future investigations on the possible effects of codon bias on the topology of the PPI network, with the aim of improving existing bioinformatics methods for predicting protein interactions.

q-bio.GN↗

arXiv2020

Bacterial protein interaction networks: connectivity is ruled by gene conservation, essentiality and function

Protein-protein interaction (PPI) networks are the backbone of all processes in living cells. In this work we relate conservation, essentiality and functional repertoire of a gene to the connectivity $k$ (i.e., the number of interaction links) of the corresponding protein in the PPI network. On a set of 42 bacterial genomes of different sizes, and with reasonably separated evolutionary trajectories, we investigate three issues: i) whether the distribution of connectivities changes between PPI subnetworks of essential and nonessential genes; ii) how gene conservation, measured both by the evolutionary retention index (ERI) and by evolutionary pressures, is related to the the connectivity of the corresponding protein; iii) how PPI connectivities are modulated by evolutionary and functional relationships, as represented by the Clusters of Orthologous Genes (COGs). We show that conservation, essentiality and functional specialisation of genes constrain the connectivity of the corresponding proteins in bacterial PPI networks. In particular, we isolate a core of highly connected proteins (with connectivities $k\ge40$), which is ubiquitous among the species considered here -- though mostly visible in the degree distributions of bacteria with small genomes (less than 1000 genes). The genes that belong to this highly connected core are conserved, essential and, in most cases, belong to the COG cluster J, related to ribosomal functions and to the processing of genetic information.

q-bio.GN↗

arXiv2020

True scale-free networks hidden by finite size effects

We analyze about two hundred naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned on the basis of statistical testing of the validity of power law distributions of network degrees by contrasting real data. Specifically, we analyze by finite-size scaling analysis the datasets of real networks to check whether purported departures from the power law behavior are due to the finiteness of the sample size. In this case, power laws would be recovered in the case of progressively larger cutoffs induced by the size of the sample. We find that a large number of the networks studied follow a finite size scaling hypothesis without any self-tuning. This is the case of biological protein interaction networks, technological computer and hyperlink networks, and informational networks in general. Marked deviations appear in other cases, especially infrastructure and transportation but also social networks. We conclude that underlying scale invariance properties of many naturally occurring networks are extant features often clouded by finite-size effects due to the nature of the sample data.

physics.soc-ph↗

arXiv2020

Network Sensitivity of Systemic Risk

A growing body of studies on systemic risk in financial markets has emphasized the key importance of taking into consideration the complex interconnections among financial institutions. Much effort has been put in modeling the contagion dynamics of financial shocks, and to assess the resilience of specific financial markets - either using real network data, reconstruction techniques or simple toy networks. Here we address the more general problem of how shock propagation dynamics depends on the topological details of the underlying network. To this end we consider different realistic network topologies, all consistent with balance sheets information obtained from real data on financial institutions. In particular, we consider networks of varying density and with different block structures, and diversify as well in the details of the shock propagation dynamics. We confirm that the systemic risk properties of a financial network are extremely sensitive to its network features. Our results can aid in the design of regulatory policies to improve the robustness of financial markets.

q-fin.RM↗

arXiv2020

Generalized Markov stability of network communities

We address the problem of community detection in networks by introducing a general definition of Markov stability, based on the difference between the probability fluxes of a Markov chain on the network at different time scales. The specific implementation of the quality function and the resulting optimal community structure thus become dependent both on the type of Markov process and on the specific Markov times considered. For instance, if we use a natural Markov chain dynamics and discount its stationary distribution -- that is, we take as reference process the dynamics at infinite time -- we obtain the standard formulation of the Markov stability. Notably, the possibility to use finite-time transition probabilities to define the reference process naturally allows detecting communities at different resolutions, without the need to consider a continuous-time Markov chain in the small time limit. The main advantage of our general formulation of Markov stability based on dynamical flows is that we work with lumped Markov chains on network partitions, having the same stationary distribution of the original process. In this way the form of the quality function becomes invariant under partitioning, leading to a self-consistent definition of community structures at different aggregation scales.

physics.soc-ph↗

arXiv2019

The Statistical Physics of Real-World Networks

In the last 15 years, statistical physics has been a very successful framework to model complex networks. On the theoretical side, this approach has brought novel insights into a variety of physical phenomena, such as self-organisation, scale invariance, emergence of mixed distributions and ensemble non-equivalence, that display unconventional features on heterogeneous networks. At the same time, thanks to their deep connection with information theory, statistical physics and the principle of maximum entropy have led to the definition of null models for networks reproducing some features of real-world systems, but otherwise as random as possible. We review here the statistical physics approach and the various null models for complex networks, focusing in particular on the analytic frameworks reproducing the local network features. We then show how these models have been used to detect statistically significant and predictive structural patterns in real-world networks, as well as to reconstruct the network structure in case of incomplete information. We further survey the statistical physics models that reproduce more complex, semi-local network features using Markov chain Monte Carlo sampling, as well as the models of generalised network structures such as multiplex networks, interacting networks and simplicial complexes.

physics.soc-ph↗