Non-backtracking PageRank
From MaRDI portal
Publication:2330663
DOI10.1007/s10915-019-00981-8zbMath1425.65046OpenAlexW2903403228MaRDI QIDQ2330663
Vanni Noferini, Desmond J. Higham, Francesca Arrigo
Publication date: 22 October 2019
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-019-00981-8
Computational methods for sparse matrices (65F50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Iterative numerical methods for linear systems (65F10) Random walks on graphs (05C81)
Related Items (6)
Ergodicity Coefficients for Higher-Order Stochastic Processes ⋮ Kemeny's constant for nonbacktracking random walks ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs ⋮ Beyond non-backtracking: non-cycling network centrality measures ⋮ Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An Ihara formula for partially directed graphs
- On the exponential generating function for non-backtracking walks
- Zeta functions of finite graphs and coverings
- Ihara zeta functions of digraphs
- PageRank Beyond the Web
- Spectral redemption in clustering sparse networks
- A Google-like model of road network dynamics and its application to regulation and control
- Random Alpha PageRank
- Localized eigenvectors of the non-backtracking matrix
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Centrality in networks of urban streets
- Random matrices, nonbacktracking walks, and orthogonal polynomials
- Quantum chaos on discrete graphs
- Ordinal Ranking for Google's PageRank
- Matrix Analysis
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
- Deeper Inside PageRank
- Harmonic Analysis on Symmetric Spaces—Euclidean Space, the Sphere, and the Poincaré Upper Half-Plane
- The non-backtracking spectrum of the universal cover of a graph
- Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
- Fast PageRank Computation via a Sparse Linear System
- Traffic modelling framework for electric vehicles
This page was built for publication: Non-backtracking PageRank