Nonlocal pagerank
From MaRDI portal
Publication:5006301
DOI10.1051/m2an/2020071OpenAlexW3003540821MaRDI QIDQ5006301
Fabio Durastante, Stefano Cipolla, 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
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of graph theory to circuits and networks (94C15) Data structures (68P05)
Related Items
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, A Theory for Backtrack-Downweighted Walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- A note on certain ergodicity coefficients
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- DNA electrophoresis studied with the cage model
- The graph bottleneck identity
- An Arnoldi-type algorithm for computing Page Rank
- Improved bounds for a condition number for Markov chains
- Path Laplacian operators and superdiffusive processes on graphs. II. two-dimensional lattice
- A modularity based spectral method for simultaneous community and anti-community detection
- Shifted and extrapolated power methods for tensor \(\ell^p\)-eigenpairs
- Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
- On a Question Concerning Condition Numbers for Markov Chains
- Navigability of interconnected networks under random failures
- The university of Florida sparse matrix collection
- Non-backtracking walk centrality for directed networks
- Random multi-hopper model: super-fast random walks on graphs
- A Matrix Perturbation View of the Small World Phenomenon
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Perturbation of the stationary distribution measured by ergodicity coefficients
- Sparse matrix test problems
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Localized Eigenvectors from Widely Spaced Matrix Modifications
- Comparing Top k Lists
- Community structure in social and biological networks
- Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
- Centrality Analysis for Modified Lattices
- Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to Pagerank computation
- On the Stability of Network Indices Defined by Means of Matrix Functions
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Three Hypergraph Eigenvector Centralities
- Ergodicity Coefficients for Higher-Order Stochastic Processes
- A framework for second-order eigenvector centralities and clustering coefficients
- Extrapolation methods for fixed‐point multilinear PageRank computations
- Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices
- Core-Periphery Structure in Networks
- Fast PageRank Computation via a Sparse Linear System
- A Theorem on Boolean Matrices
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
