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 vi...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Austrian Statistical Society
2019-07-01
|
| Series: | Austrian Journal of Statistics |
| Online Access: | http://www.ajs.or.at/index.php/ajs/article/view/858 |