SearcharxivSearch

arXiv · 2410.13450

An It\^o-type formula for some measure-valued processes and its application on controlled superprocesses

Abstract

We derive an It\^o-type formula for a measure-valued process that has a decomposition analogous to a classical semimartingale. The derivation begins with a time partitioning approach similar to the classical proof of It\^o's formula. To address the new challenges arising from the measure-valued setting, we employ symmetric polynomials to approximate the second-order linear derivative of the functional on finite measures, alongside certain localization techniques. A controlled superprocess with a binary branching mechanism can be interpreted as a weak solution to a controlled stochastic partial differential equation (SPDE), which naturally leads to such a decomposition. Consequently, this It\^o-type formula makes it possible to derive the Hamilton-Jacobi-Bellman (HJB) equation and the verification theorem for controlled superprocesses with a binary branching mechanism. Additionally, we propose a heuristic definition for the viscosity solution of an equation involving derivatives on finite measures. We prove that a continuous value function is a viscosity solution in this sense and demonstrate the uniqueness of the viscosity solution when the second-order derivative term on the measure vanishes.

Explore related subjects

Keep this discovery

BibTeXRIS

Shang Li. 2024-10-17. An It\^o-type formula for some measure-valued processes and its application on controlled superprocesses. https://arxiv.org/abs/2410.13450

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