SearcharxivSearch

arXiv · 2604.03125

First Passage through a Continuous Barrier: Pathwise Decomposition, Random-Time Structure, and Compensators

Abstract

Let t be the first-passage time of a continuous barrier by a c{\`a}dl{\`a}g adapted process. We show that t admits a canonical fourfold pathwise decomposition into continuous contact, contact from the left followed by an upward jump, exact hit by jump, and strict overshoot by jump from below. This refinement is more informative than the classical contact-versus-overshoot dichotomy for random-time purposes, because it separates modes with different predictability properties. In particular, the left-contact component always defines an accessible stopping time and becomes predictable under a no-premature-left-contact condition, which we prove to be both sufficient and necessary for the canonical running-supremum announcing sequence to work. On the gap side, under a structural exclusion of predictable gap-crossings, the corresponding restricted time is totally inaccessible. In the semimartingale setting, we obtain a sharp compensator criterion for the predictable-side condition, explicit compensator formulas for the jump-driven crossing modes, and a decomposition of the compensator of the default indicator into its predictable jump part and continuous part. As an application, for a mean-reverting affine jump-diffusion with upward exponential jumps, we derive the boundary-value problem governing the overshoot mode, prove that the differentiated third-order ODE is equivalent to the original problem only when a boundary compatibility condition is retained, and establish verification and uniqueness for the discounted problem. This yields an explicit Green-Volterra representation, a first-order small-q expansion expansion, and, in the undiscounted case, closed formulas for the overshoot and creeping probabilities

Explore related subjects

Keep this discovery

BibTeXRIS

Tristan Guillaume. 2026-04-03. First Passage through a Continuous Barrier: Pathwise Decomposition, Random-Time Structure, and Compensators. https://arxiv.org/abs/2604.03125

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