arXiv subjects

Diego Garlaschelli

Publications and source records attributed to Diego Garlaschelli.

124 records · Page 7Linked to original sources

arXiv2011

Reconciling long-term cultural diversity and short-term collective social behavior

An outstanding open problem is whether collective social phenomena occurring over short timescales can systematically reduce cultural heterogeneity in the long run, and whether offline and online human interactions contribute differently to the process. Theoretical models suggest that short-term collective behavior and long-term cultural diversity are mutually excluding, since they require very different levels of social influence. The latter jointly depends on two factors: the topology of the underlying social network and the overlap between individuals in multidimensional cultural space. However, while the empirical properties of social networks are well understood, little is known about the large-scale organization of real societies in cultural space, so that random input specifications are necessarily used in models. Here we use a large dataset to perform a high-dimensional analysis of the scientific beliefs of thousands of Europeans. We find that inter-opinion correlations determine a nontrivial ultrametric hierarchy of individuals in cultural space, a result unaccessible to one-dimensional analyses and in striking contrast with random assumptions. When empirical data are used as inputs in models, we find that ultrametricity has strong and counterintuitive effects, especially in the extreme case of long-range online-like interactions bypassing social ties. On short time-scales, it strongly facilitates a symmetry-breaking phase transition triggering coordinated social behavior. On long time-scales, it severely suppresses cultural convergence by restricting it within disjoint groups. We therefore find that, remarkably, the empirical distribution of individuals in cultural space appears to optimize the coexistence of short-term collective behavior and long-term cultural diversity, which can be realized simultaneously for the same moderate level of mutual influence.

physics.soc-ph↗

arXiv2010

Complex Networks and Symmetry I: A Review

In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs, the analysis of more general symmetries in real complex networks is far less developed. We argue that real networks, as any entity characterized by imperfections or errors, necessarily require a stochastic notion of invariance. We therefore propose a definition of stochastic symmetry based on graph ensembles and use it to review the main results of network theory from an unusual perspective. The results discussed here and in a companion paper show that stochastic symmetry highlights the most informative topological properties of real networks, even in noisy situations unaccessible to exact techniques.

q-fin.GN↗

arXiv2010

Complex Networks and Symmetry II: Reciprocity and Evolution of World Trade

We exploit the symmetry concepts developed in the companion review of this article to introduce a stochastic version of link reversal symmetry, which leads to an improved understanding of the reciprocity of directed networks. We apply our formalism to the international trade network and show that a strong embedding in economic space determines particular symmetries of the network, while the observed evolution of reciprocity is consistent with a symmetry breaking taking place in production space. Our results show that networks can be strongly affected by symmetry-breaking phenomena occurring in embedding spaces, and that stochastic network symmetries can successfully suggest, or rule out, possible underlying mechanisms.

q-fin.GN↗

arXiv2010

Multinetwork of international trade: A commodity-specific analysis

We study the topological properties of the multinetwork of commodity-specific trade relations among world countries over the 1992-2003 period, comparing them with those of the aggregate-trade network, known in the literature as the international-trade network (ITN). We show that link-weight distributions of commodity-specific networks are extremely heterogeneous and (quasi) log normality of aggregate link-weight distribution is generated as a sheer outcome of aggregation. Commodity-specific networks also display average connectivity, clustering, and centrality levels very different from their aggregate counterpart. We also find that ITN complete connectivity is mainly achieved through the presence of many weak links that keep commodity-specific networks together and that the correlation structure existing between topological statistics within each single network is fairly robust and mimics that of the aggregate network. Finally, we employ cross-commodity correlations between link weights to build hierarchies of commodities. Our results suggest that on the top of a relatively time-invariant ``intrinsic" taxonomy (based on inherent between-commodity similarities), the roles played by different commodities in the ITN have become more and more dissimilar, possibly as the result of an increased trade specialization. Our approach is general and can be used to characterize any multinetwork emerging as a nontrivial aggregation of several interdependent layers.

q-fin.GN↗

arXiv2009

Testing metabolic scaling theory using intraspecific allometries in Antarctic microarthropods

Quantitative scaling relationships among body mass, temperature and metabolic rate of organisms are still controversial, while resolution may be further complicated through the use of different and possibly inappropriate approaches to statistical analysis. We propose the application of a modelling strategy based on Akaike's information criteria and non-linear model fitting (nlm). Accordingly, we collated and modelled available data at intraspecific level on the individual standard metabolic rate of Antarctic microarthropods as a function of body mass (M), temperature (T), species identity (S) and high rank taxa to which species belong (G) and tested predictions from Metabolic Scaling Theory. We also performed allometric analysis based on logarithmic transformations (lm). Conclusions from lm and nlm approaches were different. Best-supported models from lm incorporated T, M and S. The estimates of the allometric scaling exponent b linking body mass and metabolic rate indicated no interspecific difference and resulted in a value of 0.696 +/- 0.105 (mean +/- 95% CI). In contrast, the four best-supported nlm models suggested that both the scaling exponent and activation energy significantly vary across the high rank taxa to which species belong, with mean values of b ranging from about 0.6 to 0.8. We therefore reached two conclusions: 1) published analyses of arthropod metabolism based on logarithmic data may be biased by data transformation; 2) non-linear models applied to Antarctic microarthropod metabolic rate suggest that intraspecific scaling of standard metabolic rate in Antarctic microarthropods is highly variable and can be characterised by scaling exponents that greatly vary within taxa, which may have biased previous interspecific comparisons that neglected intraspecific variability.

q-bio.PE↗

arXiv2009

The weighted random graph model

We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is characterized by a geometric weight distribution, a binomial degree distribution and a negative binomial strength distribution. We also characterize exactly the percolation phase transitions associated with edge removal and with the appearance of weighted subgraphs of any order and intensity. We find that even this completely null model displays a percolation behavior similar to what observed in real weighted networks, implying that edge removal cannot be used to detect community structure empirically. By contrast, the analysis of clustering successfully reveals different patterns between the WRG and real networks.

cond-mat.stat-mech↗

arXiv2009

Generalized Bose-Fermi statistics and structural correlations in weighted networks

We derive a class of generalized statistics, unifying the Bose and Fermi ones, that describe any system where the first-occupation energies or probabilities are different from subsequent ones, as in presence of thresholds, saturation, or aging. The statistics completely describe the structural correlations of weighted networks, which turn out to be stronger than expected and to determine significant topological biases. Our results show that the null behavior of weighted networks is different from what previously believed, and that a systematic redefinition of weighted properties is necessary.

physics.soc-ph↗

arXiv2009

On the rich-club effect in dense and weighted networks

For many complex networks present in nature only a single instance, usually of large size, is available. Any measurement made on this single instance cannot be repeated on different realizations. In order to detect significant patterns in a real--world network it is therefore crucial to compare the measured results with a null model counterpart. Here we focus on dense and weighted networks, proposing a suitable null model and studying the behaviour of the degree correlations as measured by the rich-club coefficient. Our method solves an existing problem with the randomization of dense unweighted graphs, and at the same time represents a generalization of the rich--club coefficient to weighted networks which is complementary to other recently proposed ones.

physics.soc-ph↗

arXiv2008

Maximum likelihood: extracting unbiased information from complex networks

The choice of free parameters in network models is subjective, since it depends on what topological properties are being monitored. However, we show that the Maximum Likelihood (ML) principle indicates a unique, statistically rigorous parameter choice, associated to a well defined topological feature. We then find that, if the ML condition is incompatible with the built-in parameter choice, network models turn out to be intrinsically ill-defined or biased. To overcome this problem, we construct a class of safely unbiased models. We also propose an extension of these results that leads to the fascinating possibility to extract, only from topological data, the `hidden variables' underlying network organization, making them `no more hidden'. We test our method on the World Trade Web data, where we recover the empirical Gross Domestic Product using only topological information.

cond-mat.dis-nn↗

arXiv2008

Self-Organization and Complex Networks

In this chapter we discuss how the results developed within the theory of fractals and Self-Organized Criticality (SOC) can be fruitfully exploited as ingredients of adaptive network models. In order to maintain the presentation self-contained, we first review the basic ideas behind fractal theory and SOC. We then briefly review some results in the field of complex networks, and some of the models that have been proposed. Finally, we present a self-organized model recently proposed by Garlaschelli et al. [Nat. Phys. 3, 813 (2007)] that couples the fitness network model defined by Caldarelli et al. [Phys. Rev. Lett. 89, 258702 (2002)] with the evolution model proposed by Bak and Sneppen [Phys. Rev. Lett. 71, 4083 (1993)] as a prototype of SOC. Remarkably, we show that the results obtained for the two models separately change dramatically when they are coupled together. This indicates that self-organized networks may represent an entirely novel class of complex systems, whose properties cannot be straightforwardly understood in terms of what we have learnt so far.

cond-mat.dis-nn↗

arXiv2008

Self-organized network evolution coupled to extremal dynamics

The interplay between topology and dynamics in complex networks is a fundamental but widely unexplored problem. Here, we study this phenomenon on a prototype model in which the network is shaped by a dynamical variable. We couple the dynamics of the Bak-Sneppen evolution model with the rules of the so-called fitness network model for establishing the topology of a network; each vertex is assigned a fitness, and the vertex with minimum fitness and its neighbours are updated in each iteration. At the same time, the links between the updated vertices and all other vertices are drawn anew with a fitness-dependent connection probability. We show analytically and numerically that the system self-organizes to a non-trivial state that differs from what is obtained when the two processes are decoupled. A power-law decay of dynamical and topological quantities above a threshold emerges spontaneously, as well as a feedback between different dynamical regimes and the underlying correlation and percolation properties of the network.

cond-mat.stat-mech↗

arXiv2008

A Self-organized model for network evolution

Here we provide a detailed analysis, along with some extensions and additonal investigations, of a recently proposed self-organised model for the evolution of complex networks. Vertices of the network are characterised by a fitness variable evolving through an extremal dynamics process, as in the Bak-Sneppen model representing a prototype of Self-Organized Criticality. The network topology is in turn shaped by the fitness variable itself, as in the fitness network model. The system self-organizes to a nontrivial state, characterized by a power-law decay of dynamical and topological quantities above a critical threshold. The interplay between topology and dynamics in the system is the key ingredient leading to an unexpected behaviour of these quantities.

physics.soc-ph↗

arXiv2008

Effects of network topology on wealth distributions

We focus on the problem of how wealth is distributed among the units of a networked economic system. We first review the empirical results documenting that in many economies the wealth distribution is described by a combination of log--normal and power--law behaviours. We then focus on the Bouchaud--Mézard model of wealth exchange, describing an economy of interacting agents connected through an exchange network. We report analytical and numerical results showing that the system self--organises towards a stationary state whose associated wealth distribution depends crucially on the underlying interaction network. In particular we show that if the network displays a homogeneous density of links, the wealth distribution displays either the log--normal or the power--law form. This means that the first--order topological properties alone (such as the scale--free property) are not enough to explain the emergence of the empirically observed \emph{mixed} form of the wealth distribution. In order to reproduce this nontrivial pattern, the network has to be heterogeneously divided into regions with variable density of links. We show new results detailing how this effect is related to the higher--order correlation properties of the underlying network. In particular, we analyse assortativity by degree and the pairwise wealth correlations, and discuss the effects that these properties have on each other.

q-fin.GN↗

arXiv2005

Multi-species grandcanonical models for networks with reciprocity

Reciprocity is a second-order correlation that has been recently detected in all real directed networks and shown to have a crucial effect on the dynamical processes taking place on them. However, no current theoretical model generates networks with this nontrivial property. Here we propose a grandcanonical class of models reproducing the observed patterns of reciprocity by regarding single and double links as Fermi particles of different `chemical species' governed by the corresponding chemical potentials. Within this framework we find interesting special cases such as the extensions of random graphs, the configuration model and hidden-variable models. Our theoretical predictions are also in excellent agreement with the empirical results for networks with well studied reciprocity.

cond-mat.dis-nn↗

arXiv2004

The scale-free topology of market investments

We propose a network description of large market investments, where both stocks and shareholders are represented as vertices connected by weighted links corresponding to shareholdings. In this framework, the in-degree ($k_{in}$) and the sum of incoming link weights ($v$) of an investor correspond to the number of assets held (\emph{portfolio diversification}) and to the invested wealth (\emph{portfolio volume}) respectively. An empirical analysis of three different real markets reveals that the distributions of both $k_{in}$ and $v$ display power-law tails with exponents $γ$ and $α$. Moreover, we find that $k_{in}$ scales as a power-law function of $v$ with an exponent $β$. Remarkably, despite the values of $α$, $β$ and $γ$ differ across the three markets, they are always governed by the scaling relation $β=(1-α)/(1-γ)$. We show that these empirical findings can be reproduced by a recent model relating the emergence of scale-free networks to an underlying Paretian distribution of `hidden' vertex properties.

cond-mat.stat-mech↗

arXiv2004

Patterns of link reciprocity in directed networks

We address the problem of link reciprocity, the non-random presence of two mutual links between pairs of vertices. We propose a new measure of reciprocity that allows the ordering of networks according to their actual degree of correlation between mutual links. We find that real networks are always either correlated or anticorrelated, and that networks of the same type (economic, social, cellular, financial, ecological, etc.) display similar values of the reciprocity. The observed patterns are not reproduced by current models. This leads us to introduce a more general framework where mutual links occur with a conditional connection probability. In some of the studied networks we discuss the form of the conditional connection probability and the size dependence of the reciprocity.

cond-mat.dis-nn↗