SearcharxivSearch

arXiv · 1911.10969

Intertwining and the Markov uniqueness problem on path spaces

Abstract

There are two open problem on the analysis of continuous paths on a Riemannian manifold, the Markov uniqueness and the independence of the closure of the differential operator $d$ on its initial domain. The operator $d$ acts naturally on $BC^1$ functions, one is concerned with its extensions to the $L^2$ spaces. With a suitable choice of an initial domain we denote by $D^{2,1}$ its closure under the graph norm. For the Wiener space, the domain of $d$ can be classified, as a consequence its extension is unique whether the initial domain is smooth cylindrical or in $BC^1$ etc. This has not shown to be the same when the measure is the probability distribution of any smooth elliptic diffusion. In an earlier paper, we have shown that the closure of $BC^\infty$ functions agree with that of smooth cylindrical functions, leaving an undesirable gap. The Markov uniqueness is essentially concerned with the problem whether there exists a unique Markov process on the path space whose Markov generator agrees with the infinite-dimensional Laplacian on $C^\infty$ cylindrical functions. Here we reduce Markov uniqueness to whether the pull back of $D^{2,1}$ by the ito map is $ D^{2,1}$ (i.e. a surjection). We also propose a possible approach for tackle this problem.

Explore related subjects

Keep this discovery

BibTeXRIS

K. D. Elworthy, Xue-Mei Li. 2019-11-21. Intertwining and the Markov uniqueness problem on path spaces. https://arxiv.org/abs/1911.10969

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