A p-Laplacian Random Walk: Application to Video Games

  • Nicolas Wicker University of Lille
  • Canh Hao Nguyen
  • Hiroshi Mamitsuka

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.

Published
2019-07-25
How to Cite
Wicker, N., Nguyen, C. H., & Mamitsuka, H. (2019). A p-Laplacian Random Walk: Application to Video Games. Austrian Journal of Statistics, 48(5), 11-16. https://doi.org/10.17713/ajs.v48i5.858