A p-Laplacian Random Walk: Application to Video Games
AUSTRIAN JOURNAL OF STATISTICS, pp. 11.0-16, 2019.
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.
Full Text (Upload PDF)
PPT (Upload PPT)