Speed and concentration of the covering time for structured coupon collectors
From MaRDI portal
Publication:5005019
DOI10.1017/apr.2020.5zbMath1473.60023arXiv1601.04455OpenAlexW3042492428MaRDI QIDQ5005019
Klas Markström, Victor Falgas-Ravry, Joel Larsson
Publication date: 4 August 2021
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04455
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Stochastic processes (60G99) Combinatorial aspects of packing and covering (05B40)
Related Items (5)
Biased random k‐SAT ⋮ Connectivity of Poissonian inhomogeneous random multigraphs ⋮ Covering a compact space by fixed-radius or growing random balls ⋮ Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete problems in probability theory
- Random coverings in several dimensions
- Threshold functions
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Some asymptotic results for occupancy problems
- How many samples does it take to see all the balls in an urn?
- Asymptotics for the random coupon collector problem
- An introduction to covering problems for random walks on graphs
- How many iid samples does it take to see all the balls in a box?
- On the number of i.i.d. samples required to observe all of the balls in an urn
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
- A survey of the coupon collector's problem with random sample sizes
- Threshold limits for cover times
- The coupon subset collection problem
- Secrecy Coverage
- Proof of the Satisfiability Conjecture for Large k
- Negative dependence and the geometry of polynomials
- Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model
- Almost all graphs with 1.44n edges are 3-colorable
- The Double Dixie Cup Problem
- Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles
- The collector's problem with group drawings
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- Some applications of the Stein-Chen method for proving Poisson convergence
- An Estimate of the Rate of Convergence to the Poisson Distribution in Group Allocation of Particles
- Random partitions in population genetics
- A Matrix Occupancy Problem
- Sampling problems for randomly broken sticks
- The asymptotic k-SAT threshold
- Asymptotic Distributions for the Coupon Collector's Problem
- Foundations of Genetic Algorithms
- The two possible values of the chromatic number of a random graph
- Degree sequences of random digraphs and bipartite graphs
This page was built for publication: Speed and concentration of the covering time for structured coupon collectors
