ترغب بنشر مسار تعليمي؟ اضغط هنا

Local phase transitions in a model of multiplex networks with heterogeneous degrees and inter-layer coupling

175   0   0.0 ( 0 )
 نشر من قبل Valerio Gemmetto
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Multilayer networks represent multiple types of connections between the same set of nodes. Clearly, a multilayer description of a system adds value only if the multiplex does not merely consist of independent layers, i.e. if the inter-layer overlap is nontrivial. On real-world multiplexes, it is expected that the observed overlap may partly result from spurious correlations arising from the heterogeneity of nodes and partly from true interdependencies. However, no rigorous way to disentangle these two effects has been developed. In this paper we introduce an unbiased maximum-entropy model of multiplexes with controllable node degrees and controllable overlap. The model can be mapped to a generalized Ising model where the combination of node heterogeneity and inter-layer coupling leads to the possibility of local phase transitions. In particular, we find that an increased heterogeneity in the network results in different critical points for different pairs of nodes, which in turn leads to local phase transitions that may ultimately increase the overlap. The model allows us to quantify how the overlap can be increased by either increasing the heterogeneity of the network (spurious correlation) or the strength of the inter-layer coupling (true correlation), thereby disentangling the two effects. As an application, we show that the empirical overlap in the International Trade Multiplex is not merely a spurious result of the correlation between node degrees across different layers, but requires a non-zero inter-layer coupling in its modeling.



قيم البحث

اقرأ أيضاً

Network robustness is a central point in network science, both from a theoretical and a practical point of view. In this paper, we show that layer degradation, understood as the continuous or discrete loss of links weight, triggers a structural trans ition revealed by an abrupt change in the algebraic connectivity of the graph. Unlike traditional single layer networks, multiplex networks exist in two phases, one in which the system is protected from link failures in some of its layers and one in which all the system senses the failure happening in one single layer. We also give the exact critical value of the weight of the intra-layer links at which the transition occurs for continuous layer degradation and its relation to the value of the coupling between layers. This relation allows us to reveal the connection between the transition observed under layer degradation and the one observed under the variation of the coupling between layers.
Universal spectral properties of multiplex networks allow us to assess the nature of the transition between disease-free and endemic phases in the SIS epidemic spreading model. In a multiplex network, depending on a coupling parameter, $p$, the inver se participation ratio ($IPR$) of the leading eigenvector of the adjacency matrix can be in two different structural regimes: (i) layer-localized and (ii) delocalized. Here we formalize the structural transition point, $p^*$, between these two regimes, showing that there are universal properties regarding both the layer size $n$ and the layer configurations. Namely, we show that $IPR sim n^{-delta}$, with $deltaapprox 1$, and revealed an approximately linear relationship between $p^*$ and the difference between the layers average degrees. Furthermore, we showed that this multiplex structural transition is intrinsically connected with the nature of the SIS phase transition, allowing us to both understand and quantify the phenomenon. As these results are related to the universal properties of the leading eigenvector, we expect that our findings might be relevant to other dynamical processes in complex networks.
We study the robustness properties of multiplex networks consisting of multiple layers of distinct types of links, focusing on the role of correlations between degrees of a node in different layers. We use generating function formalism to address var ious notions of the network robustness relevant to multiplex networks such as the resilience of ordinary- and mutual connectivity under random or targeted node removals as well as the biconnectivity. We found that correlated coupling can affect the structural robustness of multiplex networks in diverse fashion. For example, for maximally-correlated duplex networks, all pairs of nodes in the giant component are connected via at least two independent paths and network structure is highly resilient to random failure. In contrast, anti-correlated duplex networks are on one hand robust against targeted attack on high-degree nodes, but on the other hand they can be vulnerable to random failure.
We explore the block nature of the matrix representation of multiplex networks, introducing a new formalism to deal with its spectral properties as a function of the inter-layer coupling parameter. This approach allows us to derive interesting result s based on an interpretation of the traditional eigenvalue problem. More specifically, we reduce the dimensionality of our matrices but increase the power of the characteristic polynomial, i.e, a polynomial eigenvalue problem. Such an approach may sound counterintuitive at first glance, but it allows us to relate the quadratic problem for a 2-Layer multiplex system with the spectra of the aggregated network and to derive bounds for the spectra, among many other interesting analytical insights. Furthermore, it also permits to directly obtain analytical and numerical insights on the eigenvalue behavior as a function of the coupling between layers. Our study includes the supra-adjacency, supra-Laplacian, and the probability transition matrices, which enable us to put our results under the perspective of structural phases in multiplex networks. We believe that this formalism and the results reported will make it possible to derive new results for multiplex networks in the future.
144 - Yanqing Hu , Dong Zhou , Rui Zhang 2013
Real data show that interdependent networks usually involve inter-similarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent (Parshani et al cite{PAR10B}). For example, the coupl ed world wide port network and the global airport network are intersimilar since many pairs of linked nodes (neighboring cities), by direct flights and direct shipping lines exist in both networks. Nodes in both networks in the same city are regarded as interdependent. If two neighboring nodes in one network depend on neighboring nodes in the another we call these links common links. The fraction of common links in the system is a measure of intersimilarity. Previous simulation results suggest that intersimilarity has considerable effect on reducing the cascading failures, however, a theoretical understanding on this effect on the cascading process is currently missing. Here, we map the cascading process with inter-similarity to a percolation of networks composed of components of common links and non common links. This transforms the percolation of inter-similar system to a regular percolation on a series of subnetworks, which can be solved analytically. We apply our analysis to the case where the network of common links is an ErdH{o}s-R{e}nyi (ER) network with the average degree $K$, and the two networks of non-common links are also ER networks. We show for a fully coupled pair of ER networks, that for any $Kgeq0$, although the cascade is reduced with increasing $K$, the phase transition is still discontinuous. Our analysis can be generalized to any kind of interdependent random networks system.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا