A p-Laplacian Random Walk: Application to Video Games

AUSTRIAN JOURNAL OF STATISTICS, pp. 11.0-16, 2019.

Cited by: 0|Bibtex|Views9|DOI:https://doi.org/10.17713/ajs.v48i5.858
Other Links: academic.microsoft.com

Abstract:

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.

Code:

Data:

Your rating :
0

 

Tags
Comments