arXiv subjects

Ginestra Bianconi

Publications and source records attributed to Ginestra Bianconi.

At least 145 records · Page 8Linked to original sources

arXiv2013

Multiplex PageRank

Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

physics.soc-ph↗

arXiv2013

Growing multiplex networks

We propose a modeling framework for growing multiplexes where a node can belong to different networks. We define new measures for multiplexes and we identify a number of relevant ingredients for modeling their evolution such as the coupling between the different layers and the arrival time distribution of nodes. The topology of the multiplex changes significantly in the different cases under consideration, with effects of the arrival time of nodes on the degree distribution, average shortest paths and interdependence.

physics.soc-ph↗

arXiv2013

Models, Entropy and Information of Temporal Social Networks

Temporal social networks are characterized by {heterogeneous} duration of contacts, which can either follow a power-law distribution, such as in face-to-face interactions, or a Weibull distribution, such as in mobile-phone communication. Here we model the dynamics of face-to-face interaction and mobile phone communication by a reinforcement dynamics, which explains the data observed in these different types of social interactions. We quantify the information encoded in the dynamics of these networks by the entropy of temporal networks. Finally, we show evidence that human dynamics is able to modulate the information present in social network dynamics when it follows circadian rhythms and when it is interfacing with a new technology such as the mobile-phone communication technology.

physics.soc-ph↗

arXiv2013

Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap

There is growing interest in multiplex networks where individual nodes take part in several layers of networks simultaneously. This is the case for example in social networks where each individual node has different kind of social ties or transportation systems where each location is connected to another location by different types of transport. Many of these multiplex are characterized by a significant overlap of the links in different layers. In this paper we introduce a statistical mechanics framework to describe multiplex ensembles. A multiplex is a system formed by N nodes and M layers of interactions where each node belongs to the M layers at the same time. Each layer $α$ is formed by a network $G^α$. Here we introduce the concept of correlated multiplex ensembles in which the existence of a link in one layer is correlated with the existence of a link in another layer. This implies that a typical multiplex of the ensemble can have a significant overlap of the links in the different layers. Moreover we characterize microcanonical and canonical multiplex ensembles satisfying respectively hard and soft constraints and we discuss how to construct multiplex in these ensembles. Finally we provide the expression for the entropy of these ensembles that can be useful to address different inference problems involving multiplexes.

cond-mat.dis-nn↗

arXiv2013

Percolation on interdependent networks with a fraction of antagonistic interactions

Recently, the percolation transition has been characterized on interacting networks both in presence of interdependent and antagonistic interactions. Here we characterize the phase diagram of the percolation transition in two Poisson interdependent networks with a percentage q of antagonistic nodes. We show that this system can present a bistability of the steady state solutions, and both first, and second order phase transitions. In particular, we observe a bistability of the solutions in some regions of the phase space also for a small fraction of antagonistic interactions 0 q_c=2/3 of antagonistic interactions is necessary to strongly reduce the region in phase-space in which both networks are percolating. This last result suggests that interdependent networks are robust to the presence of antagonistic interactions. Our approach can be extended to multiple networks, and to complex boolean rules for regulating the percolation phase transition.

cond-mat.dis-nn↗

arXiv2013

Percolation on interacting, antagonistic networks

Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the percolation process might present a bistability of the equilibrium solution. To this end, we introduce antagonistic interactions for which the functionality, or activity, of a node in a network is incompatible with the functionality, of the linked nodes in the other interacting networks. In particular, we study the percolation transition in two interacting networks with purely antagonistic interaction and different topology. For two antagonistic Poisson networks of different average degree we found a large region in the phase diagram in which there is a bistability of the steady state solutions of the percolation process, i.e. we can find that either one of the two networks might percolate. For two antagonistic scale-free networks we found that there is a region in the phase diagram in which, despite the antagonistic interactions, both networks are percolating. Finally we characterize the rich phase diagram of the percolation problems on two antagonistic networks, the first one of the two being a Poisson network and the second one being a scale-free network.

physics.soc-ph↗

arXiv2013

Connect and win: The role of social networks in political elections

Many networks do not live in isolation but are strongly interacting, with profound consequences on their dynamics. Here, we consider the case of two interacting social networks and, in the context of a simple model, we address the case of political elections. Each network represents a competing party and every agent on the election day can choose to be either active in one of the two networks (vote for the corresponding party) or to be inactive in both (not vote). The opinion dynamics during the election campaign is described through a simulated annealing algorithm. We find that for a large region of the parameter space the result of the competition between the two parties allows for the existence of pluralism in the society, where both parties have a finite share of the votes. The central result is that a densely connected social network is key for the final victory of a party. However, small committed minorities can play a crucial role, and even reverse the election outcome.

physics.soc-ph↗

arXiv2013

Phase transition of light on complex quantum networks

Recent advances in quantum optics and atomic physics allow for an unprecedented level of control over light-matter interactions, which can be exploited to investigate new physical phenomena. In this work we are interested in the role played by the topology of quantum networks describing coupled optical cavities and local atomic degrees of freedom. In particular, using a mean-field approximation, we study the phase diagram of the Jaynes-Cummings-Hubbard model on complex networks topologies, and we characterize the transition between a Mott-like phase of localized polaritons and a superfluid phase. We found that, for complex topologies, the phase diagram is non-trivial and well defined in the thermodynamic limit only if the hopping coefficient scales like the inverse of the maximal eigenvalue of the adjacency matrix of the network. Furthermore we provide numerical evidences that, for some complex network topologies, this scaling implies an asymptotically vanishing hopping coefficient in the limit of large network sizes. The latter result suggests the interesting possibility of observing quantum phase transitions of light on complex quantum networks even with very small couplings between the optical cavities.

quant-ph↗

arXiv2013

Superconductor-insulator transition in a network of 2d percolation clusters

In this paper we characterize the superconductor-insulator phase transition on a network of 2d percolation clusters. Sufficiently close to the percolation threshold, this network has a broad degree distribution, and at p=p_c the degree distribution becomes scale-free. We study the Transverse Ising Model on this complex topology in order to characterize the superconductor-insulator transition in a network formed by 2d percolation clusters of a superconductor material. We show, by a mean-field treatment, that the critical temperature of superconductivity depends on the maximal eigenvalue of the adjacency matrix of the network. At the percolation threshold, we find that the maximal eigenvalue of the adjacency matrix of the network of 2d percolation clusters has a maximum. In correspondence of this maximum the superconducting critical temperature T_c is enhanced. These results suggest the design of new superconducting granular materials with enhanced critical temperature.

cond-mat.stat-mech↗

arXiv2012

Monochromaticity in Neutral Evolutionary Network Models

Recent studies on epistatic networks of model organisms have unveiled a certain type of modular property called monochromaticity in which the networks are clusterable into functional modules that interact with each other through the same type of epistasis. Here we propose and study three epistatic network models that are inspired by the Duplication-Divergence mechanism to gain insight into the evolutionary basis of monochromaticity and to test if it can be explained as the outcome of a neutral evolutionary hypothesis. We show that the epistatic networks formed by these stochastic evolutionary models have monochromaticity conflict distributions that are centered close to zero and are statistically significantly different from their randomized counterparts. In particular, the last model we propose yields a strictly monochromatic solution. Our results agree with the monochromaticity findings in real organisms and point toward the possible role of a neutral mechanism in the evolution of this phenomenon.

q-bio.MN↗

arXiv2012

On dynamic network entropy in cancer

The cellular phenotype is described by a complex network of molecular interactions. Elucidating network properties that distinguish disease from the healthy cellular state is therefore of critical importance for gaining systems-level insights into disease mechanisms and ultimately for developing improved therapies. By integrating gene expression data with a protein interaction network to induce a stochastic dynamics on the network, we here demonstrate that cancer cells are characterised by an increase in the dynamic network entropy, compared to cells of normal physiology. Using a fundamental relation between the macroscopic resilience of a dynamical system and the uncertainty (entropy) in the underlying microscopic processes, we argue that cancer cells will be more robust to random gene perturbations. In addition, we formally demonstrate that gene expression differences between normal and cancer tissue are anticorrelated with local dynamic entropy changes, thus providing a systemic link between gene expression changes at the nodes and their local network dynamics. In particular, we also find that genes which drive cell-proliferation in cancer cells and which often encode oncogenes are associated with reductions in the dynamic network entropy. In summary, our results support the view that the observed increased robustness of cancer cells to perturbation and therapy may be due to an increase in the dynamic network entropy that allows cells to adapt to the new cellular stresses. Conversely, genes that exhibit local flux entropy decreases in cancer may render cancer cells more susceptible to targeted intervention and may therefore represent promising drug targets.

q-bio.MN↗

arXiv2012

A comparison between the quasi-species evolution and stochastic quantization of fields

The quasi-species equation describes the evolution of the probability that a random individual in a population carries a given genome. Here we map the quasi-species equation for individuals of a self-reproducing population to an ensemble of scalar field elementary units undergoing a creation and annihilation process. In this mapping, the individuals of the population are mapped to field units and their genome to the field value. The selective pressure is mapped to an inverse temperature βof the system regulating the evolutionary dynamics of the fields. We show that the quasi-species equation if applied to an ensemble of field units gives in the small βlimit can be put in relation with existing stochastic quantization approaches. The ensemble of field units described by the quasi-species equation relaxes to the fundamental state, describing an intrinsically dissipative dynamics. For a quadratic dispersion relation the mean energy of the system changes as a function of the inverse temperature β. For small values of βthe average energy takes a relativistic form, for large values of β, the average energy takes a classical form.

cond-mat.stat-mech↗

arXiv2012

Phase diagram of the Bose-Hubbard Model on Complex Networks

Critical phenomena can show unusual phase diagrams when defined in complex network topologies. The case of classical phase transitions such as the classical Ising model and the percolation transition has been studied extensively in the last decade. Here we show that the phase diagram of the Bose-Hubbard model, an exclusively quantum mechanical phase transition, also changes significantly when defined on random scale-free networks. We present a mean-field calculation of the model in annealed networks and we show that when the second moment of the average degree diverges the Mott-insulator phase disappears in the thermodynamic limit. Moreover we study the model on quenched networks and we show that the Mott-insulator phase disappears in the thermodynamic limit as long as the maximal eigenvalue of the adjacency matrix diverges. Finally we study the phase diagram of the model on Apollonian scale-free networks that can be embedded in 2 dimensions showing the extension of the results also to this case.

cond-mat.dis-nn↗

arXiv2012

Supercondutor-Insulator Transition on Annealed Complex Networks

Cuprates show multiphase complexity that has hindered physicists search for the mechanism of high T_c for many years. A fingerprint of electronic scale invariance has been reported recently by Fratini et al. by detecting the structural scale invariance of dopants using scanning micro x-ray diffraction. In order to shed light on critical phenomena on these materials, here we propose a stylized model capturing the essential characteristics of the superconducting-isulator transition of a highly dynamical, heterogenous granular material: the Disordered Quantum Tranverse Ising Model (DQTIM) on Annealed Complex Network. We show that when the networks encode for high heterogeneity of the expected degrees described by a power law distribution, the critical temperature for the onset of the supercoducting phase diverges to infinity as the power-law exponent γof the expected degree distribution is less than 3, i.e. γ<3. Moreover we investigate the case in which the critical state of the electronic background is triggered by an external parameter g that determines an exponential cutoff in the power law expected degree distribution characterized by an exponent γ. We find that for g=g_c the critical temperature for the superconduting-insulator transition has a maximum is γ>3 and diverges if γ<3.

cond-mat.stat-mech↗

arXiv2012

Features and heterogeneities in growing network models

Many complex networks from the World-Wide-Web to biological networks are growing taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document as personal page, thematic website, news, blog, search engine, social network, ect. or the classification of a gene in a functional module. Moreover the feature of a node can be a continuous variable such as the position of a node in the embedding space. In order to account for these properties, in this paper we provide a generalization of growing network models with preferential attachment that includes the effect of heterogeneous features of the nodes. The main effect of heterogeneity is the emergence of an "effective fitness" for each class of nodes, determining the rate at which nodes acquire new links. The degree distribution exhibits a multiscaling behaviour analogous to the the fitness model. This property is robust with respect to variations in the model, as long as links are assigned through effective preferential attachment. Beyond the degree distribution, in this paper we give a full characterization of the other relevant properties of the model. We evaluate the clustering coefficient and show that it disappears for large network size, a property shared with the Barabási-Albert model. Negative degree correlations are also present in the studied class of models, along with non-trivial mixing patterns among features. We therefore conclude that both small clustering coefficients and disassortative mixing are outcomes of the preferential attachment mechanism in general growing networks.

physics.soc-ph↗

arXiv2012

Enhancement of Tc in the Superconductor-Insulator Phase Transition on Scale-Free Networks

A road map to understand the relation between the onset of the superconducting state with the particular optimum heterogeneity in granular superconductors is to study a Random Tranverse Ising Model on complex networks with a scale-free degree distribution regularized by and exponential cutoff p(k) \propto k^{-γ}\exp[-k/ξ]. In this paper we characterize in detail the phase diagram of this model and its critical indices both on annealed and quenched networks. To uncover the phase diagram of the model we use the tools of heterogeneous mean-field calculations for the annealed networks and the most advanced techniques of quantum cavity methods for the quenched networks. The phase diagram of the dynamical process depends on the temperature T, the coupling constant J and on the value of the branching ratio / where k is the degree of the nodes in the network. For fixed value of the coupling the critical temperature increases linearly with the branching ration which diverges with the increasing cutoff value ξor value of the γexponent γ< 3. This result suggests that the fractal disorder of the superconducting material can be responsible for an enhancement of the superconducting critical temperature. At low temperature and low couplings T<<1 and J<<1, instead, we observe a different behavior for annealed and quenched networks. In the annealed networks there is no phase transition at zero temperature while on quenched network we observe a Griffith phase dominated by extremely rare events and a phase transition at zero temperature. The Griffiths critical region, nevertheless, is decreasing in size with increasing value of the cutoff ξof the degree distribution for values of the γexponents γ< 3.

cond-mat.dis-nn↗

arXiv2012

Entropy of dynamical social networks

Human dynamical social networks encode information and are highly adaptive. To characterize the information encoded in the fast dynamics of social interactions, here we introduce the entropy of dynamical social networks. By analysing a large dataset of phone-call interactions we show evidence that the dynamical social network has an entropy that depends on the time of the day in a typical week-day. Moreover we show evidence for adaptability of human social behavior showing data on duration of phone-call interactions that significantly deviates from the statistics of duration of face-to-face interactions. This adaptability of behavior corresponds to a different information content of the dynamics of social human interactions. We quantify this information by the use of the entropy of dynamical networks on realistic models of social interactions.

physics.soc-ph↗

arXiv2011

Entropy rate of non-equilibrium growing networks

New entropy measures have been recently introduced for the quantification of the complexity of networks. Most of these entropy measures apply to static networks or to dynamical processes defined on static complex networks. In this paper we define the entropy rate of growing network models. This entropy rate quantifies how many labeled networks are typically generated by the growing network models. We analytically evaluate the difference between the entropy rate of growing tree network models and the entropy of tree networks that have the same asymptotic degree distribution. We find that the growing networks with linear preferential attachment generated by dynamical models are exponentially less than the static networks with the same degree distribution for a large variety of relevant growing network models. We study the entropy rate for growing network models showing structural phase transitions including models with non-linear preferential attachment. Finally, we bring numerical evidence that the entropy rate above and below the structural phase transitions follow a different scaling with the network size.

cond-mat.dis-nn↗