Search arXiv⌕ Search

arXiv · 2610.23482

On the relation between transformations of SDEs and of associated Kolmogorov equations

Abstract

The relationship between transformations of one-dimensional stochastic differential equations and those of the associated Kolmogorov backward equations is investigated. Stochastic transformations combining deterministic time changes, space-time diffeomorphisms, and Girsanov-type changes of probability measure are shown to be in correspondence with admissible transformations of the associated linear parabolic equations, namely the transformations preserving the parabolic structure up to the possible introduction of a zero-order potential term. A distinguished subclass of transformations, characterized by the absence of any potential term in the transformed Kolmogorov equation, is shown to coincide exactly with Doob transformations of the underlying probability measure of the SDE. This characterization further establishes a correspondence between Doob symmetries of an SDE and Lie point symmetries of the associated Kolmogorov backward equation. This correspondence, in turn, yields a constructive (probabilistic) Lie symmetry classification of autonomous Kolmogorov backward equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Susanna Dehò, Francesco Carlo De Vecchi, Paola Morando, Stefania Ugolini. 2026-10-16. On the relation between transformations of SDEs and of associated Kolmogorov equations. https://arxiv.org/abs/2610.23482

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

KEEP EXPLORING

Related papers

Improved Mixing Rates of Directed Cycles with Additional Sparse Interconnections

We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of $n$ vertices and perturbed only at approximately $n^{1/ρ}$ random locations with an appropriate, possibly sparse, interconnection structure. Together with a strong asymmetry along the cycle, the gap of the resulting chain can be bounded inversely proportionally by the longest arc length (up to logarithmic factors) with high probability, providing a significant mixing speedup compared to the reversible version.

math.PR↗

Strongly vertex-reinforced jump process on graphs with bounded degree

We study asymptotic behaviours of a non-linear vertex-reinforced jump process defined on an arbitrary infinite graph with bounded degree. We prove that if the reinforcement function $w$ is reciprocally integrable and non-decreasing, then the process visits only a finite number of vertices. In the case where $w$ is regularly varying with index $α>1$, we show that the process eventually gets stuck on a star-shaped subgraph and there is exactly one vertex with unbounded local time.

math.PR↗

A Note on the Stability of Monotone Markov Chains

This note studies monotone Markov chains, a subclass of Markov chains with extensive applications in operations research and economics. While the properties that ensure the global stability of these chains are well studied, their establishment often relies on the fulfillment of a certain splitting condition. We address the challenges of verifying the splitting condition by introducing simple, applicable conditions that ensure global stability. The simplicity of these conditions is demonstrated through various examples including autoregressive processes, portfolio allocation problems and resource allocation dynamics.

math.PR↗