SearcharxivSearch

arXiv · 1412.1896

On structure of regular Dirichlet subspaces for one-dimensional Brownian motion

Abstract

The main purpose of this paper is to explore the structure of regular subspaces of 1-dim Brownian motion. As outlined in \cite{FMG} every such regular subspace can be characterized by a measure-dense set $G$. When $G$ is open, $F=G^c$ is the boundary of $G$ and, before leaving $G$, the diffusion associated with the regular subspace is nothing but Brownian motion. Their traces on $F$ still inherit the inclusion relation, in other words, the trace Dirichlet form of regular subspace on $F$ is still a regular subspace of trace Dirichlet form of one-dimensional Brownian motion on $F$. Moreover we have proved that the trace of Brownian motion on $F$ may be decomposed into two part, one is the trace of the regular subspace on $F$, which has only the non-local part and the other comes from the orthogonal complement of the regular subspace, which has only the local part. Actually the orthogonal complement of regular subspace corresponds to a time-changed Brownian motion after a darning transform.

Explore related subjects

Keep this discovery

BibTeXRIS

Liping Li, Jiangang Ying. 2014-12-05. On structure of regular Dirichlet subspaces for one-dimensional Brownian motion. https://arxiv.org/abs/1412.1896

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