Compatibility, embedding and regularization of non-local random walks on graphs
Abstract
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes, which allow a random walker to {\textquotedblleft jump\textquotedblright} to non-neighborhood nodes, most notably the transformed path graph Laplacians and the fractional graph Laplacian. From a rigorous point of view, this new dynamics is made possible by having replaced the original graph with a weighted complete graph on the same node-set, that depends on and wherein the presence of new edges allows a direct passage between nodes that were not neighbors in . We show that, in general, the graph is not compatible with the dynamics characterizing the original model graph : the random walks on subjected to move on the edges of are not stochastically equivalent, in the wide sense, to the random walks on . From a purely analytical point of view, the incompatibility of with means that the normalized graph can not be embedded into the normalized graph . Eventually, we provide a regularization method to guarantee such compatibility and preserving at the same time all the nice properties granted by .
Cite
@article{arxiv.2101.00425,
title = {Compatibility, embedding and regularization of non-local random walks on graphs},
author = {Davide Bianchi and Marco Donatelli and Fabio Durastante and Mariarosa Mazza},
journal= {arXiv preprint arXiv:2101.00425},
year = {2022}
}