SearcharxivSearch

arXiv · 1409.7171

Construction and analysis of a sticky reflected distorted Brownian motion

Abstract

We give a Dirichlet form approach for the construction of a distorted Brownian motion in $E:=[0,\infty)^n$, $n\in\mathbb{N}$, where the behavior on the boundary is determined by the competing effects of reflection from and pinning at the boundary (sticky boundary behavior). In providing a Skorokhod decomposition of the constructed process we are able to justify that the stochastic process is solving the underlying stochastic differential equation weakly for quasi every starting point with respect to the associated Dirichlet form. That the boundary behavior of the constructed process indeed is sticky, we obtain by proving ergodicity of the constructed process. Therefore, we are able to show that the occupation time on specified parts of the boundary is positive. In particular, our considerations enable us to construct a dynamical wetting model (also known as Ginzburg--Landau dynamics) on a bounded set $D_{\scriptscriptstyle{N}}\subset \mathbb{Z}^d$ under mild assumptions on the underlying pair interaction potential in all dimensions $d\in\mathbb{N}$. In dimension $d=2$ this model describes the motion of an interface resulting from wetting of a solid surface by a fluid.

Explore related subjects

Keep this discovery

BibTeXRIS

Torben Fattler, Martin Grothaus, Robert Voßhall. 2014-09-25. Construction and analysis of a sticky reflected distorted Brownian motion. https://arxiv.org/abs/1409.7171

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