A p-Laplacian Random Walk: Application to Video Games

A graph random walk is presented. It is derived from the p-Laplacian similarly to the derivation of the canonical random walk from the Laplacian. This variant enables quicker exploration while still sticking to the connection constraints given by the graph. A potential application is shown for video games.