Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
From MaRDI portal
Recommendations
- Beyond non-backtracking: non-cycling network centrality measures
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- The deformed graph Laplacian and its applications to network centrality analysis
- Non-backtracking walk centrality for directed networks
- On the exponential generating function for non-backtracking walks
Cites work
- A Scalable Generative Graph Model with Community Structure
- Collective dynamics of `small-world' networks
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Community structure in social and biological networks
- Distinguishing graphs with zeta functions and generalized spectra
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 1495995 (Why is no real title available?)
- Network science. With Márton Pósfai
- Non-backtracking PageRank
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Non-backtracking walk centrality for directed networks
- On the exponential generating function for non-backtracking walks
- Spectral redemption in clustering sparse networks
- Statistical mechanics of complex networks
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
Cited in
(17)- A Theory for Backtrack-Downweighted Walks
- Vaccination with partial transmission and social distancing on contact networks
- On the non-backtracking spectral radius of graphs
- Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
- Kemeny's constant for nonbacktracking random walks
- Centrality-Based Traffic Restriction in Delayed Epidemic Networks
- There is no going back: properties of the non-backtracking Laplacian
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
- Controlling the spread of infectious diseases by using random walk method to remove many important links
- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
- Spectral theory of the non-backtracking Laplacian for graphs
- Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem
- Maximal colourings for graphs
- Hitting times for second-order random walks
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- Complex non-backtracking matrix for directed graphs
- Effects of backtracking on PageRank
This page was built for publication: Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999399)
