相关论文: An elementary proof that the first hitting time of…

We give a short and elementary proof that the first hitting time of a $F_\sigma$ set by the jump process of a c\`{a}dl\`{a}g adapted process is a stopping time.

There exists a simple, didactically useful one-to-one relationship between stopping times and adapted c\`agl\`ad (LCRL) processes that are non-increasing and take the values 0 and 1 only. As a consequence, stopping times are always hitting…

Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

We show that any cadlag predictable process of finite variation is an a.s. limit of elementary predictable processes; it follows that predictable stopping times can be approximated `from below' by predictable stopping times which take…

In this short paper, we connect the procedure of constructing a totally inaccessible stopping time for a given process using the well-known Cox construction, dependent on an independent exponential random variable; with naturally occurring…

Let (Xt, t >= 0) be a diffusion process with jumps, sum of a Brownian motion with drift and a compound Poisson process. We consider T_x the first hitting time of a fixed level x > 0 by (Xt, t >= 0). We prove that the law of T_x has a…

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…

We consider a class of jump processes in euclidean space which are associated to a certain non-local symmetric Dirichlet form. We prove a lower bound on the occupation times of sets, and that a support theorem holds for these processes.

We study the first-passage properties of a jump process with constant drift where jump amplitudes and inter-arrival times follow arbitrary light-tailed distributions with smooth densities. Using a mapping to an effective discrete-time…

Three notions of random stopping times exist in the literature. We introduce two concepts of equivalence of random stopping times, motivated by optimal stopping problems and stopping games respectively. We prove that these two concepts…

We present a formal system for proving the partial correctness of a single-pass instruction sequence as considered in program algebra by decomposition into proofs of the partial correctness of segments of the single-pass instruction…

We prove two lower bounds for stopping times of sequential tests between general composite nulls and alternatives. The first lower bound is for the setting where the type-1 error level $\alpha$ approaches zero, and equals $\log(1/\alpha)$…

We investigate the convergence of hitting times for jump-diffusion processes. Specifically, we study a sequence of stochastic differential equations with jumps. Under reasonable assumptions, we establish the convergence of solutions to the…

A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…

Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…

We consider a class of pure jump Markov processes in $\rr^d$ whose jump kernels are comparable to those of symmetric stable processes. We prove a support theorem, a lower bound on the occupation times of sets, and show that we can…

We define the hitting time for a model of continuous-time open quantum walks in terms of quantum jumps. Our starting point is a master equation in Lindblad form, which can be taken as the quantum analogue of the rate equation for a…

We study the leading term in the small-time asymptotics of at-the-money call option prices when the stock price process $S$ follows a general martingale. This is equivalent to studying the first centered absolute moment of $S$. We show that…

We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent…