<p>This paper deals with Gelfand-type problems <Equation ID="Equ1"> <EquationNumber>0.1</EquationNumber> <MediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_Equ1.gif" Format="GIF" Height="43" Rendition="HTML" Resolution="72" Type="Linedraw" Width="235" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \qquad \qquad \left\{ \begin{array}{ll} - \Delta _m u = \lambda f(u), \quad &amp; \hbox {in} \ \Omega , \ \lambda &gt;0, \\ u =0, \quad &amp; \hbox {on} \ \partial _m\Omega , \end{array} \right. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mspace width="2em" /> <mspace width="2em" /> <mfenced open="{"> <mrow> <mtable> <mtr> <mtd columnalign="left"> <mrow> <mo>-</mo> <msub> <mi mathvariant="normal">Δ</mi> <mi>m</mi> </msub> <mi>u</mi> <mo>=</mo> <mi>λ</mi> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mspace width="1em" /> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mtext>in</mtext> <mspace width="4pt" /> <mi mathvariant="normal">Ω</mi> <mo>,</mo> <mspace width="4pt" /> <mi>λ</mi> <mo>&gt;</mo> <mn>0</mn> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="left"> <mrow> <mrow /> <mi>u</mi> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mspace width="1em" /> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mtext>on</mtext> <mspace width="4pt" /> <msub> <mi>∂</mi> <mi>m</mi> </msub> <mi mathvariant="normal">Ω</mi> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </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 <i>f</i> as in the local case, we show there exists an extremal parameter <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="84" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lambda ^* \in (0, \infty )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>λ</mi> <mo>∗</mo> </msup> <mo>∈</mo> <mrow> <mo stretchy="false">(</mo> <mn>0</mn> <mo>,</mo> <mi>∞</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> such that, for <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="82" /> </InlineMediaObject> <EquationSource Format="TEX">\(0 \le \lambda &lt; \lambda ^*\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>≤</mo> <mi>λ</mi> <mo>&lt;</mo> <msup> <mi>λ</mi> <mo>∗</mo> </msup> </mrow> </math></EquationSource> </InlineEquation>, problem (<InternalRef RefID="Equ1">0.1</InternalRef>) admits a minimal bounded solution <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_IEq3.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(u_\lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>u</mi> <mi>λ</mi> </msub> </math></EquationSource> </InlineEquation> and there are not solution for <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lambda &gt; \lambda ^*\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>λ</mi> <mo>&gt;</mo> <msup> <mi>λ</mi> <mo>∗</mo> </msup> </mrow> </math></EquationSource> </InlineEquation>. Moreover, assuming <i>f</i> is convex, we show that Problem (<InternalRef RefID="Equ1">0.1</InternalRef>) admits a minimal bounded solution for <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lambda = \lambda ^*\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>λ</mi> <mo>=</mo> <msup> <mi>λ</mi> <mo>∗</mo> </msup> </mrow> </math></EquationSource> </InlineEquation>. We also show that <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="526_2025_3021_Article_IEq3.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(u_\lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>u</mi> <mi>λ</mi> </msub> </math></EquationSource> </InlineEquation> are stable, and, for <i>f</i> 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.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Gelfand-type problems in random walk spaces

  • J. M. Mazon,
  • A. Molino,
  • J. Toledo

摘要

This paper deals with Gelfand-type problems 0.1 \(\begin{aligned} \qquad \qquad \left\{ \begin{array}{ll} - \Delta _m u = \lambda f(u), \quad & \hbox {in} \ \Omega , \ \lambda >0, \\ u =0, \quad & \hbox {on} \ \partial _m\Omega , \end{array} \right. \end{aligned}\) - Δ m u = λ f ( u ) , in Ω , λ > 0 , u = 0 , on m Ω , 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 \(\lambda ^* \in (0, \infty )\) λ ( 0 , ) such that, for \(0 \le \lambda < \lambda ^*\) 0 λ < λ , problem (0.1) admits a minimal bounded solution \(u_\lambda \) u λ and there are not solution for \(\lambda > \lambda ^*\) λ > λ . Moreover, assuming f is convex, we show that Problem (0.1) admits a minimal bounded solution for \(\lambda = \lambda ^*\) λ = λ . We also show that \(u_\lambda \) 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.