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, namely the walk
is transient only for lattice dimensions . The generalization of
Polya’s recurrence theorem remains valid for the class of random walks with
L'evy flight asymptotics for long-range steps. We also analyze for the
Fractional Random Walk mean first passage probabilities, mean first passage
times, and global mean first passage times (Kemeny constant). For the infinite
1D lattice (infinite ring) we obtain for the transient regime
closed form expressions for the fractional lattice Green’s function matrix
containing the escape and ever passage probabilities. The ever passage
probabilities fulfill Riesz potential power law decay asymptotic behavior for
nodes far from the departure node. The non-locality of the Fractional Random
Walk is generated by the non-diagonality of the fractional Laplacian matrix
with L'evy type heavy tailed inverse power law decay for the probability of
long-range moves.

生成讲解博客的中文版本

生成AI智能校验的中文版本