Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal

Published: Oct 26, 2021
Abstract
The spectral radius of the non-backtracking matrix for an undirected graph plays an important role in various dynamic processes running on the graph. For example, its reciprocal provides an excellent approximation of epidemic and edge percolation thresholds. In this paper, we study the problem of minimizing the spectral radius of the non-backtracking matrix of a graph with n nodes and m edges, by deleting k selected edges. We show that the...
Paper Details
Title
Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal
Published Date
Oct 26, 2021
Journal
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.