Related papers: The structure of entrance and exit at infinity for…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
We consider bounded extremum seeking controls for time-varying linear systems with uncertain coefficient matrices and measurement uncertainty. Using a new change of variables, Lyapunov functions, and a comparison principle, we provide…
We study an anytime control algorithm for situations where the processing resources available for control are time-varying in an a priori unknown fashion. Thus, at times, processing resources are insufficient to calculate control inputs. To…
This paper deals with control of partially observable discrete-time stochastic systems. It introduces and studies Markov Decision Processes with Incomplete Information and with semi-uniform Feller transition probabilities. The important…
We consider a finite-state, continuous-time Markov process, represented in the "linear framework" by a directed graph with labelled edges which specifies the infinitesimal generator of the process. If the graph is strongly connected, the…
Taking account of recent developments in the representation of $d$-dimensional isotropic stable L\'evy processes as self-similar Markov processes, we consider a number of new ways to condition its path. Suppose that $\Omega$ is a region of…
For a L\'evy process on the real line, we provide complete criteria for the finiteness of exponential moments of the first passage time into the interval $(r,\infty)$, the sojourn time in the interval $(-\infty,r]$, and the last exit time…
We wish to characterise when a L\'{e}vy process $X_t$ crosses boundaries like $t^\kappa$, $\kappa>0$, in a one or two-sided sense, for small times $t$; thus, we enquire when $\limsup_{t\downarrow 0}|X_t|/t^{\kappa}$, $\limsup_{t\downarrow…
Let X and Y be time-homogeneous Markov processes with common state space E, and assume that the transition kernels of X and Y admit densities with respect to suitable reference measures. We show that if there is a time t>0 such that, for…
Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while…
Extensions of Kemeny's constant, as derived for irreducible finite Markov chains in discrete time, to Markov renewal processes and Markov chains in continuous time are discussed. Three alternative Kemeny's functions and their variants are…
We consider a L\'evy process that starts from $x<0$ and conditioned on having a positive maximum. When Cram\'er's condition holds, we provide two weak limit theorems as $x\to -\infty$ for the law of the (two-sided) path shifted at the first…
In this paper, we study the speed of extinction of continuous state branching processes in subcritical L\'evy environments. More precisely, when the associated L\'evy process to the environment drifts to $-\infty$ and, under a suitable…
These notes were used in a short graduate course on branching processes the author gave in Beijing Normal University. The following main topics are covered: scaling limits of Galton--Watson processes, continuous-state branching processes,…
In this paper we consider two related stochastic models. The first one is a branching system consisting of particles moving according to a Markov family in R^d and undergoing subcritical branching with a constant rate of V>0. New particles…
The first passage time process of a L\'evy subordinator with heavy-tailed L\'evy measure has long-range dependent paths. The random fluctuations that appear under two natural schemes of summation and time scaling of such stochastic…
In this work, we study a family of non-Markovian trees modeling populations where individuals live and reproduce independently with possibly time-dependent birth-rate and lifetime distribution. To this end, we use the coding process…
Nonlinear Markov chains with finite state space have been introduced in Kolokoltsov (2010). The characteristic property of these processes is that the transition probabilities do not only depend on the state, but also on the distribution of…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
We consider a branching system consisting of particles moving according to a Markov family in $\Rd$ and undergoing subcritical branching with a constant rate $V>0$. New particles immigrate to the system according to homogeneous space-time…