On Birthday, Collectors', Occupancy and Other Classical Urn Problems
From MaRDI portal
Publication:3725239
Recommendations
Cited in
(45)- Limiting Distributions in Sequential Occupancy Problem
- Limit distributions for the problem of collecting pairs
- Extended stirling family of discrete probability distributions
- On discrete distributions generated from drawing balls with bivariate labels
- Statistical distributions connected to motion of substance in a channel of a network
- Monotonicity, asymptotic normality and vertex degrees in random graphs
- Analysis and optimization of recruitment stocking problems
- Gamma-distribution order statistics, maximal multinomial frequency and randomization de\-signs
- scientific article; zbMATH DE number 4050627 (Why is no real title available?)
- Stopping Rules in Balanced Allocation Problems: Exact and Asymptotic Distributions
- A phase transition for the heights of a fragmentation tree
- An examination of the negative occupancy distribution and the coupon-collector distribution
- A note on Banach's match box problem
- Analytical depoissonization and its applications
- scientific article; zbMATH DE number 1865928 (Why is no real title available?)
- The siblings of the coupon collector
- Generalized birthday problems in the large-deviations regime
- General asymptotic estimates for the coupon collector problem
- Normal order statistics and sums of geometric random variables in treatment allocation prob\-lems
- Three distributions in the extended occupancy problem
- Simulation Analysis of System Life when Component Lives are Determined by a Marked Point Process
- The Gifi system of descriptive multivariate analysis.
- On the distribution for the duration of a randomized leader election algorithm
- Convergence of point processes associated with coupon collector's and Dixie cup problems
- The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
- Asymptotic regimes for the occupancy scheme of multiplicative cascades
- The Classical Occupancy Distribution: Computation and Approximation
- A survey of the coupon collector's problem with random sample sizes
- Omnibus sequences, coupon collection, and missing word counts
- Rates of convergence in certain limit theorem for extreme values
- Speed and concentration of the covering time for structured coupon collectors
- Poisson approximation and dna sequence matching
- Methods for Studying Generalized Birthday and Coupon Collection Problems
- Randomization with non-uniform allocations: fulfillment time distributions and bias properties
- Random coverings of thin sets
- Coupon collector's problem and generalized Pareto distributions
- Large deviation asymptotics for occupancy problems.
- Coupon subset collection problem with quotas
- Card guessing and the birthday problem for sampling without replacement
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
- The general birthday problem
- Finite representability of integers as 2-sums
- Asymptotics of multivariate contingency tables with fixed marginals
- A Poisson limit law for a generalized birthday problem
- The logarithmic Zipf law in a general urn problem
This page was built for publication: On Birthday, Collectors', Occupancy and Other Classical Urn Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725239)
