相关论文: On some transformations between positive self--sim…

Given a spectrally negative L\'evy process $X$ drifting to infinity, (inspired on the early ideas of Shiryaev (2002)) we are interested in finding a stopping time that minimises the $L^p$ distance ($p>1$) with $g$, the last time $X$ is…

We consider a Markov additive process with a finite phase space and study its path decompositions at the times of extrema, first passage and last exit. For these three families of times we establish splitting conditional on the phase, and…

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…

Consider a Markov chain $(X_n)_{n\geqslant 0}$ with values in the state space $\mathbb X$. Let $f$ be a real function on $\mathbb X$ and set $S_0=0,$ $S_n = f(X_1)+\cdots + f(X_n),$ $n\geqslant 1$. Let $\mathbb P_x$ be the probability…

A continuous-time Markov process $X$ can be conditioned to be in a given state at a fixed time $T > 0$ using Doob's $h$-transform. This transform requires the typically intractable transition density of $X$. The effect of the $h$-transform…

We consider Markov decision processes with synchronizing objectives, which require that a probability mass of $1-\epsilon$ accumulates in a designated set of target states, either once, always, infinitely often, or always from some point…

Piecewise deterministic Markov processes (PDMPs) are a class of stochastic processes with applications in several fields of applied mathematics spanning from mathematical modeling of physical phenomena to computational methods. A PDMP is…

Suppose that $(X_t)_{t \ge 0}$ is a one-dimensional Brownian motion with negative drift $-\mu$. It is possible to make sense of conditioning this process to be in the state $0$ at an independent exponential random time and if we kill the…

We consider the almost semi-continuous processes defined on a finite Markov chain. The representation of the moment generating functions for the absolute maximum after achievement positive level and for the recovery time are obtained.…

We consider a general method for the approximation of the distribution of a process conditioned to not hit a given set. Existing methods are based on particle system that are failable, in the sense that, in many situations , they are not…

There are some positively divisible non-Markovian processes whose transition matrices satisfy the Chapman-Kolmogorov equation. These processes should also satisfy the Kolmogorov consistency conditions, an essential requirement for a process…

For any two-sided jumping $\alpha$-stable process, where $1 < \alpha < 2$, we find an explicit identity for the law of the first hitting time of the origin. This complements existing work in the symmetric case and the spectrally one-sided…

We study a method that involves principally convex feasibility-seeking and makes secondary efforts of objective function value reduction. This is the well-known superiorization method (SM), where the iterates of an asymptotically convergent…

The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…

We consider a strong Markov process with killing and prove an approximation method for the distribution of the process conditioned not to be killed when it is observed. The method is based on a Fleming-Viot type particle system with…

We consider a discrete time semi-Markov process where the characteristics defining the process depend on a small perturbation parameter. It is assumed that the state space consists of one finite communicating class of states and, in…

We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables. First, we show that several…

We study a class of self-similar jump type SDEs driven by H\"older-continuous drift and noise coefficients. Using the Lamperti transformation for positive self-similar Markov processes we obtain a necessary and sufficient condition for…

This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of…

Consider a Markov chain $\{X_n\}_{n\ge 0}$ with an ergodic probability measure $\pi$. Let $\Psi$ a function on the state space of the chain, with $\alpha$-tails with respect to $\pi$, $\alpha\in (0,2)$. We find sufficient conditions on the…