Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.06042

Separating Times for One-Dimensional General Diffusions

David Criens·Mikhail Urusov
View original source ↗Read source document ↗Export metadata ↓

Abstract

The separating time for two probability measures on a filtered space is an extended stopping time which captures the phase transition between equivalence and singularity. More specifically, two probability measures are equivalent before their separating time and singular afterwards. In this paper, we investigate the separating time for two laws of general one-dimensional regular continuous strong Markov processes, so-called general diffusions, which are parameterized via scale functions and speed measures. Our main result is a representation of the corresponding separating time as (loosely speaking) a hitting time of a deterministic set which is characterized via speed and scale. As hitting times are fairly easy to understand, our result gives access to explicit and easy-to-check sufficient and necessary conditions for two laws of general diffusions to be (locally) absolutely continuous and/or singular. Most of the related literature treats the case of stochastic differential equations. In our setting we encounter several novel features, which are due to general speed and scale on the one hand, and to the fact that we do not exclude (instantaneous or sticky) reflection on the other hand. These new features are discussed in a variety of examples. As an application of our main theorem, we investigate the no arbitrage concept no free lunch with vanishing risk (NFLVR) for a single asset financial market whose (discounted) asset is modeled as a general diffusion which is bounded from below (e.g., non-negative). More precisely, we derive deterministic criteria for NFLVR and we identify the (unique) equivalent local martingale measure as the law of a certain general diffusion on natural scale.

Explore related subjects

math.PRq-fin.GN

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Criens, Mikhail Urusov. 2025-02-07. Separating Times for One-Dimensional General Diffusions. https://arxiv.org/abs/2211.06042

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

KEEP EXPLORING

Related papers

arXiv2026

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR↗
arXiv2026

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR↗
arXiv2026

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR↗