Computing Absorbing Times via Fluid Approximations - Archive ouverte HAL Access content directly
Journal Articles Advances in Applied Probability Year : 2017

Computing Absorbing Times via Fluid Approximations

(1) , (1)


In this paper, we compute the absorbing time Tn of a n-dimensional discrete time Markov chain made of n components, each with an absorbing state and evolving in mutual exclusion. We show that the random absorbing time Tn is well approximated by a deterministic time tn that is the first time when a fluid approximation of the chain approaches the absorbing state at a distance 1/n. We provide an asymptotic expansion of tn that uses the spectral decomposition of the kernel of the chain as well as the asymptotic distribution of Tn, relying on extreme values theory. We show the applicability of this approach with three different problems: the coupon collector, the erasure channel lifetime and the coupling times of random walks in high dimensional spaces.
Fichier principal
Vignette du fichier
gastGaujal_absorbingTimeFluid_AAP2017.pdf (533.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01553138 , version 1 (04-07-2017)


  • HAL Id : hal-01553138 , version 1


Nicolas Gast, Bruno Gaujal. Computing Absorbing Times via Fluid Approximations. Advances in Applied Probability, 2017. ⟨hal-01553138⟩
187 View
165 Download


Gmail Facebook Twitter LinkedIn More