Related papers: On some transformations between positive self--sim…

Piecewise-deterministic Markov processes (PDMPs) are often used to model abrupt changes in the global environment or capabilities of a controlled system. This is typically done by considering a set of "operating modes" (each with its own…

For each $n$ let $Y^n_t$ be a continuous time symmetric Markov chain with state space $n^{-1} \Z^d$. A condition in terms of the conductances is given for the convergence of the $Y^n_t$ to a symmetric Markov process $Y_t$ on $\R^d$. We have…

We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampling. Our algorithms are based on a new notion of an…

Hybrid systems, and Piecewise Deterministic Markov Processes in particular, are widely used to model and numerically study systems exhibiting multiple time scales in biochemical reaction kinetics and related areas. In this paper an almost…

In this paper we consider the problem of finding entrance laws at the origin for self-similar Markov processes in $\mathbb{R}^d$, killed upon hitting the origin. Under mild assumptions, we show the existence of an entrance law and the…

We present a numerical method to compute the survival function and the moments of the exit time for a piecewise-deterministic Markov process (PDMP). Our approach is based on the quantization of an underlying discrete-time Markov chain…

For Cox processes we construct a Markov process with increasing paths to couple the condensations of the Cox process in a monotone way. A similar procedure procedure yields an analogue Markov process for the P\'olya sum process. Moreover,…

In this paper we develop a statistical estimation technique to recover the transition kernel $P$ of a Markov chain $X=(X_m)_{m \in \mathbb N}$ in presence of censored data. We consider the situation where only a sub-sequence of $X$ is…

Let $(S_n)_n$ be the random process on $\mathbb R$ driven by the product of i.i.d. non-negative random matrices and $\tau$ its exit time from $]0, +\infty[$. By using the adapted strategy initiated by D. Denisov and V. Wachtel, we obtain an…

Finding the correct encoding for a generic dynamical system's trajectory is a complicated task: the symbolic sequence needs to preserve the invariant properties from the system's trajectory. In theory, the solution to this problem is found…

A zero-sum two-person Perfect Information Semi-Markov game (PISMG) under limiting ratio average payoff has a value and both the maximiser and the minimiser have optimal pure semi-stationary strategies. We arrive at the result by first…

We introduce the concept of `discrete-time persistence', which deals with zero-crossings of a continuous stochastic process, X(T), measured at discrete times, T = n \Delta T. For a Gaussian Markov process with relaxation rate \mu, we show…

We study a class of Piecewise Deterministic Markov Processes with state space Rd x E where E is a finite set. The continuous component evolves according to a smooth vector field that is switched at the jump times of the discrete coordinate.…

Since the seminal work of Lamperti there is a lot of interest in the understanding of the general structure of self-similar Markov processes. Lamperti gave a representation of positive self-similar Markov processes with initial condition…

This paper deals with the question of conditional sampling and prediction for the class of stationary max-stable processes which allow for a mixed moving maxima representation. We develop an exact procedure for conditional sampling using…

For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima…

We consider piecewise deterministic Markov processes with degenerate transition kernels of the "house-of-cards"-type. We use a splitting scheme based on jump times to prove the absolute continuity, as well as some regularity, of the…

This paper is concerned with the development of rigorous approximations to various expectations associated with Markov chains and processes having non-stationary transition probabilities. Such non-stationary models arise naturally in…

We consider the class of Piecewise Deterministic Markov Processes (PDMP), whose state space is $\R\_{+}^{*}$, that possess an increasing deterministic motion and that shrink deterministically when they jump. Well known examples for this…

This paper concentrates on the minimal hitting probability of continuous-time controlled Markov systems (CTCMSs) with countable state and finite admissible action spaces. The existence of an optimal policy is first proved. In particular,…