2022
Hitting times for second-order random walks
European Journal of Applied Mathematics, vol. 34, pp. 642–666, 2022
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is not allowed to revisit a node in one step. Second-order random walks can model …
2021
Nonlocal PageRank
ESAIM: Mathematical Modelling and Numerical Analysis, vol. 55, pp. 77–97, 2021
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 long-range interaction between them, does not …
2020
Ergodicity coefficients for higher-order stochastic processes
SIAM Journal on Mathematics of Data Science, vol. 2, pp. 740–769, 2020
The use of higher-order stochastic processes such as nonlinear Markov chains or vertex-reinforced random walks is significantly growing in recent years as they are much better at modeling high dimensional data and nonlinear dynamics in numerous application settings. In many cases of practical interest, these processes …