SearcharxivSearch

arXiv · 1806.00507

Smoothness of continuous state branching with immigration semigroups

Abstract

In this work we develop an original and thorough analysis of the (non)-smoothness properties of the semigroups, and their heat kernels, associated to a large class of continuous state branching processes with immigration. Our approach is based on an in-depth analysis of the regularity of the absolutely continuous part of the invariant measure combined with a substantial refinement of Ogura's spectral expansion of the transition kernels. In particular, we find new representations for the eigenfunctions and eigenmeasures that allow us to derive delicate uniform bounds that are useful for establishing the uniform convergence of the spectral representation of the semigroup acting on linear spaces that we identify. We detail several examples which illustrate the variety of smoothness properties that CBI transition kernels may enjoy and also reveal that our results are sharp. Finally, our technique enables us to provide the (eventually) strong Feller property as well as the rate of convergence to equilibrium in the total variation norm.

Explore related subjects

Keep this discovery

BibTeXRIS

Marie Chazal, Ronnie L. Loeffen, Pierre Patie. 2018-06-01. Smoothness of continuous state branching with immigration semigroups. https://arxiv.org/abs/1806.00507

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