Optimally coupling the Kolmogorov diffusion, and related optimal control problems

Kalvis M. Jansons; Paul D. Metcalfe

Home/Archive/arXiv

arXiv · math/0602365

Optimally coupling the Kolmogorov diffusion, and related optimal control problems

Kalvis M. Jansons·Paul D. Metcalfe

View original source ↗Read source document ↗Export metadata ↓

Abstract

We discuss the optimal Markovian coupling before an exponential time of the Kolmogorov diffusion, and a class of related stochastic control problems in which the aim is to hit the origin before an exponential time. We provide a scaling argument for the optimal control in the near field and use rational WKB approximation to obtain the optimal control in the far field, and compare these analytical results with numerical experiments. In some of these optimal control problems, in which the advection velocity field is bounded, we show that the probability of success field agrees exactly with its leading-order asymptotic approximation in some areas of the plane, up to an undetermined multiplicative constant. We conjecture a necessary and sufficient condition for this behaviour, which is strongly supported by numerical experiments.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Kalvis M. Jansons, Paul D. Metcalfe. 2006-02-20. Optimally coupling the Kolmogorov diffusion, and related optimal control problems. https://arxiv.org/abs/math/0602365

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗