The Perron non-backtracking eigenvalue after node addition

Consider a finite undirected unweighted graph G and add a new node to it arbitrarily connecting it to pre-existing nodes. We study the behavior of the Perron eigenvalue of the non-backtracking matrix of G before and after such a node addition. We prove an interlacing-type result for said eigenvalue, namely, the Perron eigenvalue never decreases after node addition. Furthermore, our methods lead to bounds for the difference between the eigenvalue before and after node addition. These are the first known bounds that have been established in full rigor. Our results depend on the assumption of diagonalizability of the non-backtracking matrix. Practical experience says that this assumption is fairly mild in many families of graphs, though necessary and sufficient conditions for it remain an open question.

[1]  P. Alam.  ‘T’ , 2021, Composites Engineering: An A–Z Guide.

[2]  Cristopher Moore,et al.  A message-passing approach for recurrent-state epidemic models on networks , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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

[5]  Laurent Massoulié,et al.  Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[6]  J. Friedman,et al.  THE NON-BACKTRACKING SPECTRUM OF THE UNIVERSAL COVER OF A GRAPH , 2007, 0712.0192.

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

[8]  Claudio Castellano,et al.  Relevance of backtracking paths in recurrent-state epidemic spreading on networks , 2018, Physical Review. E.

[9]  Stephan Ramon Garcia,et al.  Mathematical and physical aspects of complex symmetric operators , 2014, 1404.1304.

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

[11]  Guanrong Chen,et al.  Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal , 2021, CIKM.

[12]  T. Sunada,et al.  Zeta Functions of Finite Graphs , 2000 .

[13]  Pan Zhang.  Nonbacktracking operator for the Ising model and its applications in systems with multiple states. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Leo Torres.  Non-backtracking Spectrum: Unitary Eigenvalues and Diagonalizability. , 2020, 2007.13611.

[15]  Thomas de Quincey.  [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.

[16]  Hanghang Tong,et al.  Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization , 2021, SIAM J. Math. Data Sci..

[17]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .