A capacitary approach to Lyapunov-type inequalities for elliptic problems on weighted graphs
Abstract
We initiate the study of Lyapunov-type inequalities for Dirichlet problems driven by the discrete p-Laplacian on weighted graphs. The approach is capacitary and is based on point p-capacities and the associated capacitary radii. First, we prove general Lyapunov-type inequalities on arbitrary connected locally finite weighted graphs. These inequalities provide intrinsic lower bounds, expressed in terms of the capacitary radii, for the positive part of the potential whenever the corresponding Dirichlet problem admits a nontrivial solution. Next, we estimate these capacitary radii in several geometric settings and prove the sharpness of the resulting Lyapunov-type inequalities. As an application, we derive lower bounds for the first weighted Dirichlet eigenvalue of the discrete p-Laplacian.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.