We introduce the exit time finite state projection (ETFSP) scheme, a truncation- based method that yields approximations to the exit distribution and occupation measure associated with the time of exit from a domain (i.e., the time of first passage to the complement of the domain) of time-homogeneous continuous-time Markov chains. We prove that: (i) the computed approximations bound the measures from below; (ii) the total variation distances between the approximations and the measures decrease monotonically as states are added to the truncation; and (iii) the scheme converges, in the sense that, as the truncation tends to the entire state space, the total variation distances tend to zero. Furthermore, we give a computable bound on the total...
International audienceWe propose new bounds and approximations for the transition probabilities of a...
We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computi...
A notion of local- and global-memory functions for discrete-type distributions is introduced by anal...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
This dissertation presents a theoretical study of arbitrary discretizations of general nonequilibriu...
Computing the stationary distributions of a continuous-time Markov chain involves solving a set of l...
We consider a continuous-time Markov process on a large continuous or discrete state space. The proc...
Abstract Computing the stationary distributions of a continuous-time Markov chain (CTMC) involves s...
This thesis is a monograph on Markov chains and deterministic approximation schemes that enable the...
For dealing numerically with the infinite-state-space Markov chains, a truncation of the state space...
3siWe consider the problem of bounding mean first passage times and reachability probabilities for t...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...
International audienceWe propose new bounds and approximations for the transition probabilities of a...
We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computi...
A notion of local- and global-memory functions for discrete-type distributions is introduced by anal...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
This dissertation presents a theoretical study of arbitrary discretizations of general nonequilibriu...
Computing the stationary distributions of a continuous-time Markov chain involves solving a set of l...
We consider a continuous-time Markov process on a large continuous or discrete state space. The proc...
Abstract Computing the stationary distributions of a continuous-time Markov chain (CTMC) involves s...
This thesis is a monograph on Markov chains and deterministic approximation schemes that enable the...
For dealing numerically with the infinite-state-space Markov chains, a truncation of the state space...
3siWe consider the problem of bounding mean first passage times and reachability probabilities for t...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...
International audienceWe propose new bounds and approximations for the transition probabilities of a...
We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computi...
A notion of local- and global-memory functions for discrete-type distributions is introduced by anal...