Computing absorbing times via fluid approximations
From MaRDI portal
Publication:5233189
DOI10.1017/apr.2017.21zbMath1427.60154OpenAlexW2610202920MaRDI QIDQ5233189
Publication date: 16 September 2019
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01337950/file/absorbingTime_GastGaujal.pdf
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Ergodicity, mixing, rates of mixing (37A25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Load balancing via random local search in closed and open systems
- Asymptotic approximations for stationary distributions of many-server queues with abandonment
- Coupon collecting with quotas
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Strong approximation theorems for density dependent Markov chains
- The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points
- Coupon collector problem for non-uniform coupons and random quotas
- Eigenvalues of tridiagonal pseudo-Toeplitz matrices
- On the asymptotic behaviour of the number of trials necessary to complete a set with random selection
- Sharp asymptotics for the quasi-stationary distribution of birth-and-death processes
- The Coupon Collector's Problem Revisited: Asymptotics of the Variance
- New Results on a Generalized Coupon Collector Problem Using Markov Chains
- The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
- The Double Dixie Cup Problem
- The Generalised Coupon Collector Problem
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- The Weighted Coupon Collector’s Problem and Applications
