Related papers: Conditioned real self-similar Markov processes
We study limit theorems for partial sums of instantaneous functions of a homogeneous Markov chain on a general state space. The summands are heavy-tailed and the limits are stable distributions. The conditions imposed on the transition…
This paper studies the exponential stability of random matrix products driven by a general (possibly unbounded) state space Markov chain. It is a cornerstone in the analysis of stochastic algorithms in machine learning (e.g. for parameter…
We provide explicit conditions, in terms of the transition kernel of its driving particle, for a Markov branching process to admit a scaling limit toward a self-similar growth-fragmentation with negative index. We also derive a scaling…
A possibly time-dependent transition intensity matrix or generator $(Q(t))$ characterizes the law of a Markov jump process (MP). For a time homogeneous MP, the transition probability matrix (TPM) can be expressed as a matrix exponential of…
We investigate the parameter recovery of Markov-switching ordinary differential processes from discrete observations, where the differential equations are nonlinear additive models. This framework has been widely applied in biological…
We study K-processes, which are Markov processes in a denumerable state space, all of whose elements are stable, with the exception of a single state, starting from which the process enters finite sets of stable states with uniform…
Let $\mu$ = ($\mu$t)t$\in$R be any 1-parameter family of probability measures on R. Its quantile process (Gt)t$\in$R : ]0, 1[ $\rightarrow$ RR, given by Gt($\alpha$) = inf{x $\in$ R : $\mu$t(]--$\infty$, x]) > $\alpha$}, is not Markov in…
Max-stable processes are widely used to model spatial extremes. These processes exhibit asymptotic dependence meaning that the large values of the process can occur simultaneously over space. Recently, inverted max-stable processes have…
Many natural and engineered systems can be modeled as discrete state Markov processes. Often, only a subset of states are directly observable. Inferring the conditional probability that a system occupies a particular hidden state, given the…
We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state…
This paper proposes an identification algorithm for Single Input Single Output (SISO) Linear Time-Invariant (LTI) systems. In the noise-free setting, where the first $T$ Markov parameters can be precisely estimated, all Markov parameters…
This paper deals with unconstrained discounted continuous-time Markov decision processes in Borel state and action spaces. Under some conditions imposed on the primitives, allowing unbounded transition rates and unbounded (from both above…
When the unconditioned process is a diffusion living on the half-line $x \in ]-\infty,a[$ in the presence of an absorbing boundary condition at position $x=a$, we construct various conditioned processes corresponding to finite or infinite…
The mapped bases or Fake Nodes Approach (FNA), introduced in [10], allows to change the set of nodes without the need of resampling the function. Such scheme has been successfully applied in preventing the appearance of the Gibbs phenomenon…
We consider a class of semi-Markov processes (SMP) such that the embedded discrete time Markov chain may be non-homogeneous. The corresponding augmented processes are represented as semi-martingales using stochastic integral equation…
Statistical process monitoring (SPM) methods are essential tools in quality management to check the stability of industrial processes, i.e., to dynamically classify the process state as in control (IC), under normal operating conditions, or…
Starting from the forward and backward infinitesimal generators of bilateral, time-homogeneous Markov processes, the self-adjoint Hamiltonians of the generalized Schroedinger equations are first introduced by means of suitable Doob…
We use a Poisson point process approach to prove distributional convergence to a stable law for non square-integrable observables $\phi: [0,1]\to R$, mostly of the form $\phi (x) = d(x,x_0)^{-\frac{1}{\alpha}}$,$0<\alpha\le 2$, on…
A definition of metastable states applicable to arbitrary finite state Markov processes satisfying detailed balance is discussed. In particular, we identify a crucial condition that distinguishes genuine metastable states from other types…
The particle Gibbs (PG) sampler is a Markov Chain Monte Carlo (MCMC) algorithm, which uses an interacting particle system to perform the Gibbs steps. Each Gibbs step consists of simulating a particle system conditioned on one particle path.…