Computing absorbing times via fluid approximations

DOI10.1017/APR.2017.21MaRDI QIDQ5233189zbMATH OpenOpenAlexFDO

Authors Nicolas Gast, Bruno Gaujal

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

zbMATH Keywords

Markov chainfluid approximationextreme valuecoupon collectorcoupling time

Mathematics Subject Classification ID

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)

Recommendations

• Renewal-type behavior of absorption times in Markov chains
• Approximations for time-dependent distributions in Markovian fluid models
• On the absorption probabilities and mean time for absorption for discrete Markov chains
• Markov chains competing for transitions: application to large-scale distributed systems
• Closed Form Absorption Time Bounds

Cites work

• scientific article; zbMATH DE number 3167451 (Why is no real title available?)
• Asymptotic approximations for stationary distributions of many-server queues with abandonment
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Coupon collecting with quotas
• Coupon collector problem for non-uniform coupons and random quotas
• Eigenvalues of tridiagonal pseudo-Toeplitz matrices
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Load balancing via random local search in closed and open systems
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• New results on a generalized coupon collector problem using Markov chains
• 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
• Strong approximation theorems for density dependent Markov chains
• The Double Dixie Cup Problem
• The Generalised Coupon Collector Problem
• The Weighted Coupon Collector’s Problem and Applications
• The coupon collector's problem revisited: asymptotics of the variance
• The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
• The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points

Cited in

(2)

• Voter and majority dynamics with biased and stubborn agents
• Closed Form Absorption Time Bounds

This page was built for publication: Computing absorbing times via fluid approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233189)