SearcharxivSearch

arXiv · 2203.14791

Optimal Coupling of Jumpy Brownian Motion on the Circle

Abstract

Consider a Brownian motion on the circumference of the unit circle, which jumps to the opposite point of the circumference at incident times of an independent Poisson process of rate $\lambda$. We examine the problem of coupling two copies of this `jumpy Brownian motion' started from different locations, so as to optimise certain functions of the coupling time. We describe two intuitive co-adapted couplings (`Mirror' and `Synchronous') which differ only when the two processes are directly opposite one another, and show that the question of which strategy is best depends upon the jump rate $\lambda$ in a non-trivial way. More precisely, we use the theory of stochastic control to show that there exists a critical value $\lambda^\star = 0.083\dots$ such that the Mirror coupling minimises the mean coupling time within the class of all co-adapted couplings when $\lambda<\lambda^\star$, but for $\lambda\ge \lambda^\star$ the Synchronous coupling uniquely maximises the Laplace transform $\mathbb{E}[e^{-\gamma T}]$ of all coupling times $T$ within this class. We also provide an explicit description of a (non co-adapted) maximal coupling for any jump rate in the case that the two jumpy Brownian motions begin at antipodal points of the circle.

Explore related subjects

Keep this discovery

BibTeXRIS

Stephen B. Connor, Roberta Merli. 2022-03-28. Optimal Coupling of Jumpy Brownian Motion on the Circle. https://arxiv.org/abs/2203.14791

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