Least gradient functions in metric random walk spaces

Abstract

In this paper we study least gradient functions in metric random walk spaces, which include as particular cases the least gradient functions on locally finite weighted connected graphs and nonlocal least gradient functions on RN. Assuming that a Poincar\'e inequality is satisfied, we study the Euler-Lagrange equation associated with the least gradient problem. We also prove the Poincar\'e inequality in a few settings.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…