SearcharxivSearch

arXiv · 2211.15168

Most probable paths for developed processes

Abstract

Optimal paths for the classical Onsager-Machlup function determining most probable paths between points on a manifold are only explicitly identified for specific processes, for example the Riemannian Brownian motion. This leaves out large classes of manifold-valued processes such as processes with parallel transported non-trivial diffusion matrix, processes with rank-deficient generator and sub-Riemannian processes, and push-forwards to quotient spaces. In this paper, we construct a general approach to definition and identification of most probable paths by measuring the Onsager-Machlup function on the anti-development of such processes. The construction encompasses large classes of manifold-valued process and results in explicit equation systems for the paths that we denote \emph{development most probable paths}. We define and derive these results and apply them to several cases of stochastic processes on Lie groups, homogeneous spaces, and landmark spaces appearing in shape analysis.

Explore related subjects

Keep this discovery

BibTeXRIS

Erlend Grong, Stefan Sommer. 2022-11-28. Most probable paths for developed processes. https://arxiv.org/abs/2211.15168

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