Nonlocal PageRank

@article{Cipolla2020NonlocalP,
  title={Nonlocal PageRank},
  author={Stefano Cipolla and Fabio Durastante and Francesco Tudisco},
  journal={ArXiv},
  year={2020},
  volume={abs/2001.10421}
}
In this work we introduce and study a nonlocal version of the PageRank. In our approach, the random walker explores the graph using longer excursions than just moving between neighboring nodes. As a result, the corresponding ranking of the nodes, which takes into account a \textit{long-range interaction} between them, does not exhibit concentration phenomena typical of spectral rankings which take into account just local interactions. We show that the predictive value of the rankings obtained… 
View PDF on arXiv
10 Citations
Background Citations
5
Methods Citations
3

10 Citations

Optimizing network robustness via Krylov subspaces

The paper proposes two novel strategies combining Krylov subspace approximations with a greedy scheme and with the limited-memory BFGS, and discusses the computational and modeling aspects of the methodology and illustrates the various optimization problems on networks that can be addressed within the proposed framework.

Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks

Nonlocal diffusion of variable order on complex networks

Some aspects of nonlocal dynamics on directed and undirected networks for an initial value problem whose Jacobian matrix is a variable-order fractional power of a Laplacian matrix are discussed here.…

Hitting times for second-order random walks

By introducing the ‘pullback’ first-order stochastic process of a second-order random walk, this work provides second- order versions of the renowned Kac’s and Random Target Lemmas.

Compatibility, embedding and regularization of non-local random walks on graphs

Node and edge nonlinear eigenvector centrality for hypergraphs

A family of nonlinear eigenvector centrality measures for both edges and nodes in hypergraphs are defined, an algorithm to calculate them is proposed, and their application on real-world data sets is illustrated.

Nonlocal diffusion of variable order on graphs

Some aspects of nonlocal dynamics on directed and undirected networks for an initial value problem whose Jacobian matrix is a variable-order fractional power of a Laplacian matrix are discussed here.…

Hitting times for non-backtracking random walks

This work shows how to compute the average number of steps a non- backtracking walker takes to reach a specific node starting from a given node and shows that mean return times for non-backtracking random walks coincide with their analogue for random walks in all finite, undirected graphs in which both stochastic processes are well-defined.

Node and edge nonlinear eigenvector centrality for hypergraphs

A family of nonlinear eigenvector centrality measures for both edges and nodes in hypergraphs are defined, an algorithm to calculate them is proposed, and their application on real-world data sets is illustrated.

A Theory for Backtrack-Downweighted Walks

A complete theory for the combinatorics of walk-counting on a directed graph in the case where each backtracking step is downweighted by a given factor is developed, and it is shown that backtrack-downweighted Katz-style network centrality can be computed at the same cost as standard Katz.

64 References

A framework for second-order eigenvector centralities and clustering coefficients

A mutually reinforcing (spectral) version of the classical clustering coefficient is defined and established under appropriate conditions, and it is shown that the new spectral measures can be computed efficiently with a nonlinear power method.

Shifted and extrapolated power methods for tensor 𝓁p-eigenpairs

An extrapolation framework based on the simplified topological $\varepsilon$-algorithm to efficiently accelerate the shifted power sequences and results on synthetic and real world problems show the improvements gained by the introduction of the shifting parameter and the efficiency of the acceleration technique.

Shifted and extrapolated power methods for tensor $\ell^p$-eigenpairs

An extrapolation framework based on the simplified topological $\varepsilon$-algorithm to efficiently accelerate the shifted power sequences and results on synthetic and real world problems show the improvements gained by the introduction of the shifting parameter and the efficiency of the acceleration technique.

Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices

It is proved that the coefficient matrices arising in the 1D context are rank structured and can be efficiently represented using hierarchical formats, and how these properties can be leveraged to design fast solvers for problems with 2D spatial domains that can be reformulated as matrix equations.

Higher-order ergodicity coefficients

This work shows that the proposed higher-order ergodicity coefficients provide new explicit formulas that guarantee the uniqueness of Perron $Z$-eigenvectors of stochastic tensors, provide bounds on the sensitivity of such eigenvector with respect to changes in the tensor and ensure the convergence of different types ofHigher-order power methods to the stationary distribution of higher- order and vertex-reinforced Markov chains.

Ergodicity Coefficients for Higher-Order Stochastic Processes

The proposed higher-order ergodicity coefficients provide new explicit formulas that guarantee the uniqueness of Perron $Z$-eigenvectors of stochastic tensors and provide bounds on the sensitivity of such eigenvector with respect to changes in the tensor.

Extrapolation methods for fixed‐point multilinear PageRank computations

This work introduces an extrapolation‐based acceleration of power method type algorithms, namely, the shifted fixed‐point method and the inner‐outer method, and shows remarkably better performance, with faster convergence rates and reduced overall computational time.

Centrality of an Urban Rail System

Railway re-emerges as one of the most important man-made physical systems in the world. Hundreds of million passengers travel by trains within cities. Hence, the management and maintenance of rail…

Improved bounds for a condition number for Markov chains

Nonnegative Matrices in the Mathematical Sciences

1. Matrices which leave a cone invariant 2. Nonnegative matrices 3. Semigroups of nonnegative matrices 4. Symmetric nonnegative matrices 5. Generalized inverse- Positivity 6. M-matrices 7. Iterative…
...