Gelfand-Type problems in Random Walk Spaces
Abstract
This paper deals with Gelfand-type problems equationGelfand10 \arrayll - m u = λ f(u), &in \ , \ λ >0, \\[10pt] u =0, &on \ ∂m, array . equation in the framework of Random Walk Spaces, which includes as particular cases: Gelfand-type problems posed on locally finite weighted connected graphs and Gelfand-type problems driven by convolution integrable kernels. Under the same assumption on the nonlinearity f as in the local case, we show there exists an extremal parameter λ* ∈ (0, ∞) such that, for 0 ≤ λ < λ*, problem Gelfand10 admits a minimal bounded solution uλ and there are not solution for λ > λ*. Moreover, assuming f is convex, we show that Problem Gelfand10 admits a minimal bounded solution for λ = λ*. We also show that uλ are stable, and, for f strictly convex, we show that they are the unique stable solutions. We give simple examples that illustrate the many situations that can occur when solving Gelfand-type problems on weighted graphs.
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.