Core structure: The coupling failure procedure in multiplex networks

Abstract Multiplex networks are a special class of multilayered networks in which a fixed set of nodes is connected by different types of links. The core organization, the residual graph from recursively removing dead-end nodes and their nearest neighbor, plays a significant role in a wide range of typical problems. However previous study about core structure ignored the fact that many real systems are coupled together. In this paper, we firstly generalize the pruning algorithm for multiplex networks, such that leaves in multiplex networks are redefined. The extended pruning algorithm corresponds to a coupling failure procedure in multiplex networks. We develop an analytical approach to study the structural stability of multiplex networks under this scenario. Specifically, by implementing the rate-equation approach to this generalized pruning process, we can analyze a set of cores and describe the birth point and their structures. Moreover, to clarify the general results, we solve the rate equation in four different distribution multiplex networks with two layers: Erdos Renyi, exponentially distributed, purely power-law distributed, and static model networks. Finally, we explore the possible origin for the unique transition behavior in multiplex networks.

[1]  Jung Yeol Kim,et al.  Coevolution and correlated multiplexity in multiplex networks , 2013, Physical review letters.

[2]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[3]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[4]  Miguel Romance,et al.  Eigenvector centrality of nodes in multiplex networks , 2013, Chaos.

[5]  S N Dorogovtsev,et al.  Heterogeneous k-core versus bootstrap percolation on complex networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[7]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[8]  Conrado J. Pérez Vicente,et al.  Diffusion dynamics on multiplex networks , 2012, Physical review letters.

[9]  M. Bauer,et al.  Core percolation in random graphs: a critical phenomena analysis , 2001, cond-mat/0102011.

[10]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[11]  Tamás Vicsek,et al.  Controlling edge dynamics in complex networks , 2011, Nature Physics.

[12]  Sergey N. Dorogovtsev,et al.  K-core Organization of Complex Networks , 2005, Physical review letters.

[13]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Juan Wang,et al.  Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices , 2017, Appl. Math. Comput..

[16]  Sergey N. Dorogovtsev,et al.  Core organization of directed complex networks , 2012, ArXiv.

[17]  Chengyi Xia,et al.  Interdependency enriches the spatial reciprocity in prisoner’s dilemma game on weighted networks , 2016 .

[18]  Alexander K. Hartmann,et al.  The number of guards needed by a museum: A phase transition in vertex covering of random graphs , 2000, Physical review letters.

[19]  Endre Csóka,et al.  Core percolation on complex networks , 2012, Physical review letters.

[20]  K-I Goh,et al.  Network robustness of multiplex networks with interlayer degree correlations. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Zhen Wang,et al.  Heterogeneous Coupling between Interdependent Lattices Promotes the Cooperation in the Prisoner’s Dilemma Game , 2015, PloS one.

[22]  Sergey N. Dorogovtsev,et al.  k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  R. Pastor-Satorras,et al.  Analytic solution of a static scale-free network model , 2005 .

[24]  Lenka Zdeborová,et al.  The number of matchings in random graphs , 2006, ArXiv.

[25]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[26]  Jianguo Liu,et al.  Ranking the spreading ability of nodes in network core , 2015 .

[27]  Alexander K. Hartmann,et al.  Solution-space structure of (some) optimization problems , 2007, 0711.3912.

[28]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Yamir Moreno,et al.  Evolutionary dynamics on interdependent populations. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Kwang-Il Goh,et al.  Towards real-world complexity: an introduction to multiplex networks , 2015, ArXiv.

[31]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[32]  Zhongke Gao,et al.  Spatial prisoner's dilemma games with increasing neighborhood size and individual diversity on two interdependent lattices , 2015 .

[33]  Wei Li,et al.  Cascading Failures in Interdependent Lattice Networks: The Critical Role of the Length of Dependency Links , 2012, Physical review letters.

[34]  D. Sornette,et al.  Stretched exponential distributions in nature and economy: “fat tails” with characteristic scales , 1998, cond-mat/9801293.

[35]  Yamir Moreno,et al.  Contact-based Social Contagion in Multiplex Networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Haijun Zhou,et al.  Vertex cover problem studied by cavity method: Analytics and population dynamics , 2003 .

[37]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.