Localization of nonbacktracking centrality on dense subgraphs of sparse networks

Abstract

The nonbacktracking matrix, and the related nonbacktracking centrality (NBC) play a crucial role in models of percolation-type processes on networks, such as non-recurrent epidemics. Here we study the localization of NBC in infinite sparse networks that contain an arbitrary finite subgraph. Assuming the local tree-likeness of the enclosing network, and that branches emanating from the finite subgraph do not intersect at finite distances, we show that the largest eigenvalue of the nonbacktracking matrix of the composite network is equal to the highest of the two largest eigenvalues: that of the finite subgraph and of the enclosing network. In the localized state, when the largest eigenvalue of the subgraph is the highest of the two, we derive explicit expressions for the NBCs of nodes in the subgraph and other nodes in the network. In this state, nonbacktracking centrality is concentrated on the subgraph and its immediate neighbourhood in the enclosing network. We obtain simple, exact formulas in the case where the enclosing network is uncorrelated. We find that the mean NBC decays exponentially around the finite subgraph, at a rate which is independent of the structure of the enclosing network, contrary to what was found for the localization of the principal eigenvector of the adjacency matrix. Numerical simulations confirm that our results provide good approximations even in moderately sized, loopy, real-world networks.

arXiv comment11 pages, 7 figures

References in corpus (18)

• Epidemic processes in complex networks
• The spread of epidemic disease on networks
• Influence maximization in complex networks through optimal percolation
• Thresholds for epidemic spreading in networks
• Spectral redemption: clustering sparse networks
• A message passing approach for general epidemic models
• Localization and Spreading of Diseases in Complex Networks
• Localization and centrality in networks
• Percolation on sparse networks
• Epidemic thresholds of the Susceptible-Infected-Susceptible model on networks: A comparison of numerical and theoretical results
• A message-passing approach for recurrent-state epidemic models on networks
• Intermittent social distancing strategy for epidemic control
• Leveraging percolation theory to single out influential spreaders in networks
• Identifying an influential spreader from a single seed in complex networks via a message-passing approach
• The localization of non-backtracking centrality in networks and its physical consequences
• Metastable Localization of Diseases in Complex Networks
• Nonbacktracking expansion of finite graphs
• Heterogeneous micro-structure of percolation in sparse networks