SearcharxivSearch

arXiv · 2608.11931

Nonlinear parabolic characterizations of stochastic completeness at infinity on weighted graphs

Abstract

We prove a nonlinear parabolic characterization of stochastic completeness at infinity for weighted graphs. For the filtration equation \[ (\partial_t + \Delta \Phi)u =0 \] where $\Delta$ is the non-negative formal graph Laplacian and $\Phi u =\phi \circ u$ with $\phi \colon \R\to\R$ nonconstant, continuous and increasing, stochastic completeness at infinity is equivalent to uniqueness of bounded pointwise solutions for every bounded initial datum. For \(\Phi=\id\), this recovers the classical heat equation characterization of stochastic completeness at infinity, and of stochastic completeness when the killing term is trivial, i.e., when \(\kappa=0\). If stochastic completeness at infinity fails, then every bounded initial datum admits infinitely many bounded pointwise solutions of the filtration equation. Admissible nonlinearities include the signed porous medium and fast diffusion powers $\phi(s)=s|s|^{m-1}$ for all $m>0$, as well as many others. Stochastic completeness at infinity is further characterized by a generalized mass balance: the total mass of a positive pointwise solution at time $t$, augmented by the mass $\int_0^t\sum_{x}\kappa(x)\phi(u(s,x)) \dd s$ dissipated by the killing term $\kappa$, equals the initial mass. This balance holds for every bounded positive solution on graphs of finite measure and for bounded finite-mass data on graphs of arbitrary measure under the sharp condition $\limsup_{r\to0^+}\phi(r)/r<\infty$. It also extends to positive pointwise solutions in $\ell^1$ that are bounded on every positive time interval. When the killing term is trivial, stochastic completeness at infinity reduces to stochastic completeness and generalized balance to conservation of mass.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Davide Bianchi, Bobo Hua, Alberto G. Setti, Radosław K. Wojciechowski. 2026-08-12. Nonlinear parabolic characterizations of stochastic completeness at infinity on weighted graphs. https://arxiv.org/abs/2608.11931

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR