Nonlocal pagerank

DOI10.1051/M2AN/2020071MaRDI QIDQ5006301zbMATH OpenOpenAlexFDO

Authors Stefano Cipolla, Fabio Durastante, Francesco Tudisco

Publication date 13 August 2021

Published in ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.10421

zbMATH Keywords

complex networkMarkov chainnonlocal dynamicsPerron-Frobenius

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Non-backtracking PageRank
• Non-backtracking PageRank: from the classic model to Hashimoto matrices
• Multilinear PageRank
• Two accelerated non-backtracking PageRank algorithms for large-scale networks
• PageRank as a discrete Green's function

Cites work

• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• A framework for second-order eigenvector centralities and clustering coefficients
• A Matrix Perturbation View of the Small World Phenomenon
• A modularity based spectral method for simultaneous community and anti-community detection
• A Nonlinear Spectral Method for Core--Periphery Detection in Networks
• A note on certain ergodicity coefficients
• A Theorem on Boolean Matrices
• An Arnoldi-type algorithm for computing Page Rank
• Centrality analysis for modified lattices
• Community structure in social and biological networks
• Comparing Top k Lists
• Comparison of perturbation bounds for the stationary distribution of a Markov chain
• Complex networks. Structure, robustness and function.
• Core-periphery structure in networks
• DNA electrophoresis studied with the cage model
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Ergodicity Coefficients for Higher-Order Stochastic Processes
• Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to PageRank computation
• Extrapolation methods for fixed‐point multilinear PageRank computations
• Fast PageRank Computation via a Sparse Linear System
• Fast solvers for two-dimensional fractional diffusion equations using rank structured matrices
• scientific article; zbMATH DE number 5977361 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• Improved bounds for a condition number for Markov chains
• Localized Eigenvectors from Widely Spaced Matrix Modifications
• Navigability of interconnected networks under random failures
• Non-backtracking walk centrality for directed networks
• On a question concerning condition numbers for Markov chains
• On the stability of network indices defined by means of matrix functions
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
• Path Laplacian operators and superdiffusive processes on graphs. II. two-dimensional lattice
• Perturbation of the stationary distribution measured by ergodicity coefficients
• Random multi-hopper model: super-fast random walks on graphs
• Shifted and extrapolated power methods for tensor \(\ell^p\)-eigenpairs
• Sparse matrix test problems
• Spectral properties of hypergraph Laplacian and approximation algorithms
• The graph bottleneck identity
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• The Spacey Random Walk: A Stochastic Process for Higher-Order Data
• The University of Florida sparse matrix collection
• Three hypergraph eigenvector centralities

Cited in

(12)

• Non-backtracking PageRank
• Compatibility, embedding and regularization of non-local random walks on graphs
• Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks
• Local Computation of PageRank Contributions
• A Theory for Backtrack-Downweighted Walks
• Local Computation of PageRank Contributions
• Nonlocal PageRank
• Hitting times for second-order random walks
• Two accelerated non-backtracking PageRank algorithms for large-scale networks
• A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
• Updating Katz centrality by counting walks
• Walk based Laplacians for modeling diffusion on complex networks

Describes a project that uses

Uses Software

• SparseMatrix
• Harwell-Boeing sparse matrix collection
• Algorithm 97

This page was built for publication: Nonlocal pagerank

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