Biased Infinity Laplacian Boundary Problem on Finite Graphs

Host

Department of Applied Mathematics

Speaker

Zoran Šunić
Texas A&M University
http://www.math.tamu.edu/~sunik/

Description

We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the Biased Infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on an adjusted (biased) notion of a slope of a function on a path in a graph. The infinity Laplacian Boundary Problem has a probabilistic interpretation related to the expected outcome in a random-turn game on a graph under optimal play by both players. This is a joint work with Yuval Peres.

Event Topic

Nonlinear Algebra and Statistics (NLASTATS)