Searcharxiv⌕ Search

arXiv subjects

Tiziano Squartini

Publications and source records attributed to Tiziano Squartini.

At least 73 records · Page 4Linked to original sources

Multiplexity and multireciprocity in directed multiplexes

Real-world multi-layer networks feature nontrivial dependencies among links of different layers. Here we argue that, if links are directed, dependencies are twofold. Besides the ordinary tendency of links of different layers to align as the result of `multiplexity', there is also a tendency to anti-align as the result of what we call `multireciprocity', i.e. the fact that links in one layer can be reciprocated by \emph{opposite} links in a different layer. Multireciprocity generalizes the scalar definition of single-layer reciprocity to that of a square matrix involving all pairs of layers. We introduce multiplexity and multireciprocity matrices for both binary and weighted multiplexes and validate their statistical significance against maximum-entropy null models that filter out the effects of node heterogeneity. We then perform a detailed empirical analysis of the World Trade Multiplex (WTM), representing the import-export relationships between world countries in different commodities. We show that the WTM exhibits strong multiplexity and multireciprocity, an effect which is however largely encoded into the degree or strength sequences of individual layers. The residual effects are still significant and allow to classify pairs of commodities according to their tendency to be traded together in the same direction and/or in opposite ones. We also find that the multireciprocity of the WTM is significantly lower than the usual reciprocity measured on the aggregate network. Moreover, layers with low (high) internal reciprocity are embedded within sets of layers with comparably low (high) mutual multireciprocity. This suggests that, in the WTM, reciprocity is inherent to groups of related commodities rather than to individual commodities. We discuss the implications for international trade research focusing on product taxonomies, the product space, and fitness/complexity metrics.

physics.soc-ph↗

Detecting early signs of the 2007-2008 crisis in the world trade

Since 2007, several contributions have tried to identify early-warning signals of the financial crisis. However, the vast majority of analyses has focused on financial systems and little theoretical work has been done on the economic counterpart. In the present paper we fill this gap and employ the theoretical tools of network theory to shed light on the response of world trade to the financial crisis of 2007 and the economic recession of 2008-2009. We have explored the evolution of the bipartite World Trade Web (WTW) across the years 1995-2010, monitoring the behavior of the system both before and after 2007. Our analysis shows early structural changes in the WTW topology: since 2003, the WTW becomes increasingly compatible with the picture of a network where correlations between countries and products are progressively lost. Moreover, the WTW structural modification can be considered as concluded in 2010, after a seemingly stationary phase of three years. We have also refined our analysis by considering specific subsets of countries and products: the most statistically significant early-warning signals are provided by the most volatile macrosectors, especially when measured on developing countries, suggesting the emerging economies as being the most sensitive ones to the global economic cycles.

physics.soc-ph↗

Hierarchical organization of functional connectivity in the mouse brain: a complex network approach

This paper represents a contribution to the study of the brain functional connectivity from the perspective of complex networks theory. More specifically, we apply graph theoretical analyses to provide evidence of the modular structure of the mouse brain and to shed light on its hierarchical organization. We propose a novel percolation analysis and we apply our approach to the analysis of a resting-state functional MRI data set from 41 mice. This approach reveals a robust hierarchical structure of modules persistent across different subjects. Importantly, we test this approach against a statistical benchmark (or null model) which constrains only the distributions of empirical correlations. Our results unambiguously show that the hierarchical character of the mouse brain modular structure is not trivially encoded into this lower-order constraint. Finally, we investigate the modular structure of the mouse brain by computing the Minimal Spanning Forest, a technique that identifies subnetworks characterized by the strongest internal correlations. This approach represents a faster alternative to other community detection methods and provides a means to rank modules on the basis of the strength of their internal edges.

q-bio.NC↗

The double role of GDP in shaping the structure of the International Trade Network

The International Trade Network (ITN) is the network formed by trade relationships between world countries. The complex structure of the ITN impacts important economic processes such as globalization, competitiveness, and the propagation of instabilities. Modeling the structure of the ITN in terms of simple macroeconomic quantities is therefore of paramount importance. While traditional macroeconomics has mainly used the Gravity Model to characterize the magnitude of trade volumes, modern network theory has predominantly focused on modeling the topology of the ITN. Combining these two complementary approaches is still an open problem. Here we review these approaches and emphasize the double role played by GDP in empirically determining both the existence and the volume of trade linkages. Moreover, we discuss a unified model that exploits these patterns and uses only the GDP as the relevant macroeconomic factor for reproducing both the topology and the link weights of the ITN.

q-fin.GN↗

Breaking of ensemble equivalence in networks

It is generally believed that, in the thermodynamic limit, the microcanonical description as a function of energy coincides with the canonical description as a function of temperature. However, various examples of systems for which the microcanonical and canonical ensembles are not equivalent have been identified. A complete theory of this intriguing phenomenon is still missing. Here we show that ensemble nonequivalence can manifest itself also in random graphs with topological constraints. We find that, while graphs with a given number of links are ensemble-equivalent, graphs with a given degree sequence are not. This result holds irrespective of whether the energy is nonadditive (as in unipartite graphs) or additive (as in bipartite graphs). In contrast with previous expectations, our results show that: (1) physically, nonequivalence can be induced by an extensive number of local constraints, and not necessarily by long-range interactions or nonadditivity; (2) mathematically, nonquivalence is determined by a different large-deviation behaviour of microcanonical and canonical probabilities for a single microstate, and not necessarily for almost all microstates. The latter criterion, which is entirely local, is not restricted to networks and holds in general.

cond-mat.stat-mech↗

Randomizing bipartite networks: the case of the World Trade Web

Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization.

physics.soc-ph↗

Systemic risk analysis in reconstructed economic and financial networks

We address a fundamental problem that is systematically encountered when modeling complex systems: the limitedness of the information available. In the case of economic and financial networks, privacy issues severely limit the information that can be accessed and, as a consequence, the possibility of correctly estimating the resilience of these systems to events such as financial shocks, crises and cascade failures. Here we present an innovative method to reconstruct the structure of such partially-accessible systems, based on the knowledge of intrinsic node-specific properties and of the number of connections of only a limited subset of nodes. This information is used to calibrate an inference procedure based on fundamental concepts derived from statistical physics, which allows to generate ensembles of directed weighted networks intended to represent the real system, so that the real network properties can be estimated with their average values within the ensemble. Here we test the method both on synthetic and empirical networks, focusing on the properties that are commonly used to measure systemic risk. Indeed, the method shows a remarkable robustness with respect to the limitedness of the information available, thus representing a valuable tool for gaining insights on privacy-protected economic and financial systems.

physics.soc-ph↗

Information Recovery In Behavioral Networks

In the context of agent based modeling and network theory, we focus on the problem of recovering behavior-related choice information from origin-destination type data, a topic also known under the name of network tomography. As a basis for predicting agents' choices we emphasize the connection between adaptive intelligent behavior, causal entropy maximization and self-organized behavior in an open dynamic system. We cast this problem in the form of binary and weighted networks and suggest information theoretic entropy-driven methods to recover estimates of the unknown behavioral flow parameters. Our objective is to recover the unknown behavioral values across the ensemble analytically, without explicitly sampling the configuration space. In order to do so, we consider the Cressie-Read family of entropic functionals, enlarging the set of estimators commonly employed to make optimal use of the available information. More specifically, we explicitly work out two cases of particular interest: Shannon functional and the likelihood functional. We then employ them for the analysis of both univariate and bivariate data sets, comparing their accuracy in reproducing the observed trends.

physics.soc-ph↗

Unbiased sampling of network ensembles

Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. An important requirement is that the sampling process is unbiased and efficient. The main approaches are microcanonical, i.e. they sample graphs that match the enforced constraints exactly. Unfortunately, when applied to strongly heterogeneous networks (like most real-world examples), the majority of these approaches become biased and/or time-consuming. Moreover, the algorithms defined in the simplest cases, such as binary graphs with given degrees, are not easily generalizable to more complicated ensembles. Here we propose a solution to the problem via the introduction of a "Maximize and Sample" ("Max & Sam" for short) method to correctly sample ensembles of networks where the constraints are `soft', i.e. realized as ensemble averages. Our method is based on exact maximum-entropy distributions and is therefore unbiased by construction, even for strongly heterogeneous networks. It is also more computationally efficient than most microcanonical alternatives. Finally, it works for both binary and weighted networks with a variety of constraints, including combined degree-strength sequences and full reciprocity structure, for which no alternative method exists. Our canonical approach can in principle be turned into an unbiased microcanonical one, via a restriction to the relevant subset. Importantly, the analysis of the fluctuations of the constraints suggests that the microcanonical and canonical versions of all the ensembles considered here are not equivalent. We show various real-world applications and provide a code implementing all our algorithms.

stat.ME↗

Conformism-driven phases of opinion formation on heterogeneous networks: the q-voter model case

The q-voter model, a variant of the classic voter model, has been analyzed by several authors: while allowing to study opinion dynamics, this model is also believed to be one of the most representative among the many defined in the wide field of sociophysics. Here, we investigate the consequences of conformity on the consensus reaching process, by numerically simulating a q-voter model with agents behaving either as conformists or non-conformists, embedded on heterogeneous network topologies (as small-world and scale-free). In fact, although it is already known that conformity enhances the reaching of consensus, the related process is often studied only on fully-connected networks, thus strongly limiting our full understanding of it. This paper represents a first step in the direction of analyzing more realistic social models, showing that different opinion formation-phases, driven by the conformist agents density, are observable. As a result, we identify threshold values of the density of conformist agents, varying across different topologies and separating different regimes of our system, ranging from a disordered phase, where different opinions coexist, to a gradually more ordered phase, where consensus is eventually reached.

physics.soc-ph↗

Reconstructing the world trade multiplex: the role of intensive and extensive biases

In economic and financial networks, the strength of each node has always an important economic meaning, such as the size of supply and demand, import and export, or financial exposure. Constructing null models of networks matching the observed strengths of all nodes is crucial in order to either detect interesting deviations of an empirical network from economically meaningful benchmarks or reconstruct the most likely structure of an economic network when the latter is unknown. However, several studies have proved that real economic networks and multiplexes are topologically very different from configurations inferred only from node strengths. Here we provide a detailed analysis of the World Trade Multiplex by comparing it to an enhanced null model that simultaneously reproduces the strength and the degree of each node. We study several temporal snapshots and almost one hundred layers (commodity classes) of the multiplex and find that the observed properties are systematically well reproduced by our model. Our formalism allows us to introduce the (static) concept of extensive and intensive bias, defined as a measurable tendency of the network to prefer either the formation of extra links or the reinforcement of link weights, with respect to a reference case where only strengths are enforced. Our findings complement the existing economic literature on (dynamic) intensive and extensive trade margins. More in general, they show that real-world multiplexes can be strongly shaped by layer-specific local constraints.

q-fin.GN↗

Reconstructing topological properties of complex networks using the fitness model

A major problem in the study of complex socioeconomic systems is represented by privacy issues$-$that can put severe limitations on the amount of accessible information, forcing to build models on the basis of incomplete knowledge. In this paper we investigate a novel method to reconstruct global topological properties of a complex network starting from limited information. This method uses the knowledge of an intrinsic property of the nodes (indicated as fitness), and the number of connections of only a limited subset of nodes, in order to generate an ensemble of exponential random graphs that are representative of the real systems and that can be used to estimate its topological properties. Here we focus in particular on reconstructing the most basic properties that are commonly used to describe a network: density of links, assortativity, clustering. We test the method on both benchmark synthetic networks and real economic and financial systems, finding a remarkable robustness with respect to the number of nodes used for calibration. The method thus represents a valuable tool for gaining insights on privacy-protected systems.

cs.SI↗

A GDP-driven model for the binary and weighted structure of the International Trade Network

Recent events such as the global financial crisis have renewed the interest in the topic of economic networks. One of the main channels of shock propagation among countries is the International Trade Network (ITN). Two important models for the ITN structure, the classical gravity model of trade (more popular among economists) and the fitness model (more popular among networks scientists), are both limited to the characterization of only one representation of the ITN. The gravity model satisfactorily predicts the volume of trade between connected countries, but cannot reproduce the observed missing links (i.e. the topology). On the other hand, the fitness model can successfully replicate the topology of the ITN, but cannot predict the volumes. This paper tries to make an important step forward in the unification of those two frameworks, by proposing a new GDP-driven model which can simultaneously reproduce the binary and the weighted properties of the ITN. Specifically, we adopt a maximum-entropy approach where both the degree and the strength of each node is preserved. We then identify strong nonlinear relationships between the GDP and the parameters of the model. This ultimately results in a weighted generalization of the fitness model of trade, where the GDP plays the role of a `macroeconomic fitness' shaping the binary and the weighted structure of the ITN simultaneously. Our model mathematically highlights an important asymmetry in the role of binary and weighted network properties, namely the fact that binary properties can be inferred without the knowledge of weighted ones, while the opposite is not true.

q-fin.GN↗

Stationarity, non-stationarity and early warning signals in economic networks

Economic integration, globalization and financial crises represent examples of processes whose understanding requires the analysis of the underlying network structure. Of particular interest is establishing whether a real economic network is in a state of (quasi)stationary equilibrium, i.e. characterized by smooth structural changes rather than abrupt transitions. While in the former case the behaviour of the system can be reasonably controlled and predicted, in the latter case this is generally impossible. Here, we propose a method to assess whether a real economic network is in a quasi-stationary state by checking the consistency of its structural evolution with appropriate quasi-equilibrium maximum-entropy ensembles of graphs. As illustrative examples, we consider the International Trade Network (ITN) and the Dutch Interbank Network (DIN). We find that the ITN is an almost perfect example of quasi-equilibrium network, while the DIN is clearly out-of-equilibrium. In the latter, the entity of the deviation from quasi-stationarity contains precious information that allows us to identify remarkable early warning signals of the interbank crisis of 2008. These early warning signals involve certain dyadic and triadic topological properties, including dangerous 'debt loops' with different levels of interbank reciprocity.

q-fin.GN↗

Enhanced reconstruction of weighted networks from strengths and degrees

Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case, frequently encountered due to privacy issues in the analysis of interbank flows and Big Data, is when there is only local (node-specific) aggregate information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naive approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths. This implies that the reconstruction of weighted networks would be significantly enhanced by the specification of both strengths and degrees, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world examples and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously confirm that the degree sequence, as soon as it is non-trivial, is irreducible to the strength sequence. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns.

physics.data-an↗

Early-warning signals of topological collapse in interbank networks

The financial crisis clearly illustrated the importance of characterizing the level of 'systemic' risk associated with an entire credit network, rather than with single institutions. However, the interplay between financial distress and topological changes is still poorly understood. Here we analyze the quarterly interbank exposures among Dutch banks over the period 1998-2008, ending with the crisis. After controlling for the link density, many topological properties display an abrupt change in 2008, providing a clear - but unpredictable - signature of the crisis. By contrast, if the heterogeneity of banks' connectivity is controlled for, the same properties show a gradual transition to the crisis, starting in 2005 and preceded by an even earlier period during which anomalous debt loops could have led to the underestimation of counter-party risk. These early-warning signals are undetectable if the network is reconstructed from partial bank-specific data, as routinely done. We discuss important implications for bank regulatory policies.

physics.soc-ph↗

Economic networks in and out of equilibrium

Economic and financial networks play a crucial role in various important processes, including economic integration, globalization, and financial crises. Of particular interest is understanding whether the temporal evolution of a real economic network is in a (quasi-)stationary equilibrium, i.e. characterized by smooth structural changes rather than abrupt transitions. Smooth changes in quasi-equilibrium networks can be generally controlled for, and largely predicted, via an appropriate rescaling of structural quantities, while this is generally not possible for abrupt transitions in non-stationary networks. Here we study whether real economic networks are in or out of equilibrium by checking their consistency with quasi-equilibrium maximum-entropy ensembles of graphs. As illustrative examples, we consider the International Trade Network (ITN) and the Dutch Interbank Network (DIN). We show that, despite the globalization process, the ITN is an almost perfect example of quasi-equilibrium network, while the DIN is clearly an out-of-equilibrium network undergoing major structural changes and displaying non-stationary dynamics. Among the out-of-equilibrium properties of the DIN, we find striking early-warning signals of the interbank crisis of 2008.

physics.soc-ph↗

Reciprocity of weighted networks

All types of networks arise as intricate combinations of dyadic building blocks formed by pairs of vertices. In directed networks, the dyadic patterns are entirely determined by reciprocity, i.e. the tendency to form, or to avoid, mutual links. Reciprocity has dramatic effects on every networks dynamical processes and the emergence of structures like motifs and communities. The binary reciprocity has been extensively studied: that of weighted networks is still poorly understood. We introduce a general approach to it, by defining quantities capturing the observed patterns (from dyad-specific to vertex-specific and network-wide) and introducing analytically solved models (Exponential Random Graphs-type). Counter-intuitively, the previous reciprocity measures based on the similarity of the mutual links-weights are uninformative. By contrast, our measures can classify different weighted networks, track the temporal evolution of a networks reciprocity, identify patterns. We show that in some networks the local reciprocity structure can be inferred from the global one.

physics.data-an↗