Discrete infinity Laplace equations on graphs and tug-of-war games
Abstract
We study the Dirichlet problem of the following discrete infinity Laplace equation on a subgraph with finite width We say that a subgraph has finite width if the distances from all vertices to the boundary are uniformly bounded. By Perron's method, we show the existence of bounded solutions. We also prove the uniqueness if is nonnegative by establishing a comparison result, and hence obtain the existence of game values for corresponding tug-of-war games introduced by Peres, Schramm, Sheffield, and Wilson (2009). As an application we show a strong Liouville property for infinity harmonic functions. By an argument of Arzela-Ascoli, we prove the convergence of solutions of -tug-of-war games as tends to 0. Correspondingly, we obtain the existence of bounded solutions to normalized infinity Laplace equations on Euclidean domains with finite width.
Keywords
Cite
@article{arxiv.2311.01915,
title = {Discrete infinity Laplace equations on graphs and tug-of-war games},
author = {Fengwen Han and Tao Wang},
journal= {arXiv preprint arXiv:2311.01915},
year = {2023}
}