Non-backtracking PageRank

DOI10.1007/S10915-019-00981-8MaRDI QIDQ2330663zbMATH OpenOpenAlexFDO

Authors Francesca Arrigo, Desmond J. Higham, Vanni Noferini

Publication date 22 October 2019

Published in Journal of Scientific Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10915-019-00981-8

zbMATH Keywords

centralitycomplex networksnon-backtrackingPageRank

Mathematics Subject Classification ID

Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• Nonlocal pagerank
• Non-backtracking PageRank: from the classic model to Hashimoto matrices
• PageRank beyond the web
• PageRank in Undirected Random Graphs
• Multilinear PageRank
• An improved approach to the PageRank problems
• A note on the pagerank algorithm
• A Reordering for the PageRank Problem

Cites work

• A Google-like model of road network dynamics and its application to regulation and control
• An Ihara formula for partially directed graphs
• Centrality in networks of urban streets
• Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
• Deeper Inside PageRank
• Fast PageRank Computation via a Sparse Linear System
• Harmonic analysis on symmetric spaces -- Euclidean space, the sphere, and the Poincaré upper half plane
• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• scientific article; zbMATH DE number 3335806 (Why is no real title available?)
• Ihara zeta functions of digraphs
• Localized eigenvectors of the non-backtracking matrix
• Matrix Analysis
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• On the exponential generating function for non-backtracking walks
• Ordinal Ranking for Google's PageRank
• PageRank beyond the web
• Quantum chaos on discrete graphs
• Random alpha PageRank
• Random matrices, nonbacktracking walks, and orthogonal polynomials
• Spectral redemption in clustering sparse networks
• The deformed graph Laplacian and its applications to network centrality analysis
• The non-backtracking spectrum of the universal cover of a graph
• Traffic modelling framework for electric vehicles
• Zeta functions of finite graphs and coverings

Cited in

(21)

• On the -nonbacktracking centrality for complex networks: existence and limit cases
• Using PageRank for non-personalized default rankings in dynamic markets
• Black hole metric: overcoming the PageRank normalization problem
• Non-backtracking PageRank: from the classic model to Hashimoto matrices
• Dirichlet PageRank and trust-based ranking algorithms
• \texttt{PageRank} and random walks on graphs
• Multilinear PageRank
• Random surfing without teleportation
• Seeded PageRank solution paths
• Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
• Nonlocal pagerank
• Ergodicity Coefficients for Higher-Order Stochastic Processes
• Beyond non-backtracking: non-cycling network centrality measures
• Non-backtracking alternating walks
• scientific article; zbMATH DE number 2242727 (Why is no real title available?)
• Kemeny's constant for nonbacktracking random walks
• Multi-linear pseudo-PageRank for hypergraph partitioning
• Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
• Time-dependent personalized PageRank for temporal networks: discrete and continuous scales
• Two accelerated non-backtracking PageRank algorithms for large-scale networks
• Effects of backtracking on PageRank

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Non-backtracking PageRank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330663)