scientific article
From MaRDI portal
Publication:3285941
zbMath0102.35201MaRDI QIDQ3285941
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (51)
Antiduality and Möbius monotonicity: generalized coupon collector problem ⋮ Random coverings in several dimensions ⋮ Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data ⋮ Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances ⋮ Static-memory-hard functions, and modeling the cost of space vs. time ⋮ The self-power map and collecting all residue classes ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Intersections of random sets ⋮ Omnibus sequences, coupon collection, and missing word counts ⋮ On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints ⋮ The polynomial learning with errors problem and the smearing condition ⋮ The Siblings of the Coupon Collector ⋮ On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes ⋮ On primes in arithmetic progressions ⋮ Phase transition for the volume of high‐dimensional random polytopes ⋮ Extremal bipartite independence number and balanced coloring ⋮ The number of K-tons in the coupon collector problem ⋮ The logarithmic Zipf law in a general urn problem ⋮ A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees ⋮ Coupon collector's problem and generalized Pareto distributions ⋮ On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model ⋮ A Gibbs sampler on the \(n\)-simplex ⋮ Quantifying the survival uncertainty of Wolbachia-infected mosquitoes in a spatial model ⋮ When Do Envy-Free Allocations Exist? ⋮ Analysis of convergence rates of some Gibbs samplers on continuous state spaces ⋮ Discrete uncertainty principles and sparse signal processing ⋮ Some limit theorems for heights of random walks on a spider ⋮ Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA ⋮ Sampling from a mixture of different groups of coupons ⋮ Entropy-driven cutoff phenomena ⋮ The coupling method for inhomogeneous random intersection graphs. ⋮ Maximum likelihood estimation for discrete exponential families and random graphs ⋮ Uniform versus Zipf distribution in a mixing collection process ⋮ Incremental delay enumeration: space and time ⋮ Convergence of point processes associated with coupon collector's and Dixie cup problems ⋮ Reaching consensus on a connected graph ⋮ The deficiency introduced by resampling ⋮ Finite Representability of Integers as $2$-Sums ⋮ Limit distributions for the problem of collecting pairs ⋮ Asymptotics for push on the complete graph ⋮ Games of chance with multiple objectives ⋮ A generalization of the classical occupancy problem ⋮ Computing absorbing times via fluid approximations ⋮ A limit theorem for random coverings of a circle ⋮ Rates of convergence in certain limit theorem for extreme values ⋮ Speed and concentration of the covering time for structured coupon collectors ⋮ Poisson randomization in occupancy problems ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings ⋮ Maximum of exponential random variables, Hurwitz's zeta function, and the partition function ⋮ Estimating vocal repertoire size is like collecting coupons: a theoretical framework with heterogeneity in signal abundance ⋮ Collecting coupons is faster with friends
This page was built for publication:
