On recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices
T.M. Michelitsch, B.A. Collet, A.P. Riascos, A. F. Nowakowski,, F.C.G.A. Nicolleau

TL;DR
This paper generalizes Polya's recurrence theorem for fractional random walks on regular networks, analyzing their recurrence, transience, and passage times, revealing long-range step effects and non-local behavior.
Contribution
It introduces a fractional Laplacian-based random walk model, extending classical recurrence results to long-range step processes with Lévy flight characteristics.
Findings
Fractional random walks are recurrent or transient depending on the relation between dimension and alpha.
Explicit formulas for Green's functions and passage probabilities in 1D lattices.
Generalization of Polya's theorem to Lévy flight-based long-range steps.
Abstract
We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type where indicates a `simple' Laplacian matrix. We refer such walks to as `Fractional Random Walks' with admissible interval . We deduce for the Fractional Random Walk probability generating functions (network Green's functions). From these analytical results we establish a generalization of Polya's recurrence theorem for Fractional Random Walks on -dimensional infinite lattices: The Fractional Random Walk is transient for dimensions (recurrent for ) of the lattice. As a consequence for the Fractional Random Walk is transient for all lattice dimensions and in the range for dimensions . Finally, for Polya's classical recurrence theorem is recovered,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
