The localization of non-backtracking centrality in networks and its physical consequences

The spectrum of the non-backtracking matrix plays a crucial role in determining various structural and dynamical properties of networked systems, ranging from the threshold in bond percolation and non-recurrent epidemic processes, to community structure, to node importance. Here we calculate the largest eigenvalue of the non-backtracking matrix and the associated non-backtracking centrality for uncorrelated random networks, finding expressions in excellent agreement with numerical results. We show however that the same formulas do not work well for many real-world networks. We identify the mechanism responsible for this violation in the localization of the non-backtracking centrality on network subgraphs whose formation is highly unlikely in uncorrelated networks, but rather common in real-world structures. Exploiting this knowledge we present an heuristic generalized formula for the largest eigenvalue, which is remarkably accurate for all networks of a large empirical dataset. We show that this newly uncovered localization phenomenon allows to understand the failure of the message-passing prediction for the percolation threshold in many real-world structures.

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

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

[3]  Sergey N. Dorogovtsev,et al.  Localization and Spreading of Diseases in Complex Networks , 2012, Physical review letters.

[4]  H. Bass.  THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE , 1992 .

[5]  R. Pastor-Satorras,et al.  Langevin approach for the dynamics of the contact process on annealed scale-free networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[7]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[8]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[9]  M. Newman,et al.  Efficient Monte Carlo algorithm and high-precision results for percolation. , 2000, Physical review letters.

[10]  Lenka Zdeborová,et al.  Percolation on sparse networks , 2014, Physical review letters.

[11]  K. Hashimoto.  Zeta functions of finite graphs and representations of p-adic groups , 1989 .

[12]  Pol Colomer-de-Simon,et al.  Double percolation phase transition in clustered complex networks , 2014, ArXiv.

[13]  Xiao Zhang,et al.  Localization and centrality in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Claudio Castellano,et al.  Relating topological determinants of complex networks to their spectral properties: structural and dynamical effects , 2017, 1703.10438.

[15]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[16]  F. Radicchi.  Predicting percolation thresholds in networks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[18]  Romualdo Pastor-Satorras,et al.  On the numerical study of percolation and epidemic critical properties in networks , 2016, The European Physical Journal B.

[19]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[20]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[21]  Claudio Castellano,et al.  Cumulative Merging Percolation and the Epidemic Transition of the Susceptible-Infected-Susceptible Model in Networks , 2019, Physical Review. X.

[22]  Claudio Castellano,et al.  Leveraging percolation theory to single out influential spreaders in networks , 2016, Physical review. E.

[23]  S N Dorogovtsev,et al.  Nonbacktracking expansion of finite graphs. , 2017, Physical review. E.

[24]  Hanghang Tong,et al.  Node Immunization with Non-backtracking Eigenvalues , 2020, ArXiv.

[25]  Antoine Allard,et al.  Smeared phase transitions in percolation on real complex networks , 2018, Physical Review Research.

[26]  橋本 喜一朗,et al.  Automorphic forms and geometry of arithmetic varieties , 1989 .

[27]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[28]  Piet Van Mieghem,et al.  Graph Spectra for Complex Networks , 2010 .

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

[30]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[31]  Brian Karrer,et al.  Message passing approach for general epidemic models. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  R. Pastor-Satorras,et al.  Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Romualdo Pastor-Satorras,et al.  Distinct types of eigenvector localization in networks , 2015, Scientific Reports.

[34]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[35]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[36]  J. Herskowitz,et al.  Proceedings of the National Academy of Sciences, USA , 1996, Current Biology.

[37]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[38]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .