scientific article; zbMATH DE number 3167451

MaRDI QIDQ3285941zbMATH OpenFDO

Authors Alfréd Rényi, P. Erdős

Publication date 1961

zbMATH Keywords

probability theory

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Recommendations

• An occupancy problem
• The maximum occupancy number in a simple urn model
• A Poisson approximation in an urn model with indistinguishable balls
• Discrete limit distributions in the problem of balls falling in cells with arbitrary probabilities
• A note on a randomized occupancy problem

Cited in

(74)

• Limit distributions for the problem of collecting pairs
• Rates of convergence in certain limit theorem for extreme values
• Poisson randomization in occupancy problems
• An occupancy problem
• Random coverings in several dimensions
• Balls in constrained urns and Cantor-like sets
• The maximum occupancy number in a simple urn model
• Static-memory-hard functions, and modeling the cost of space vs. time
• On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints
• On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes
• On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model
• Quantifying the survival uncertainty of Wolbachia-infected mosquitoes in a spatial model
• The deficiency introduced by resampling
• 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
• Collecting coupons is faster with friends
• The polynomial learning with errors problem and the smearing condition
• 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
• Estimating vocal repertoire size is like collecting coupons: a theoretical framework with heterogeneity in signal abundance
• Coupon collector's problem and generalized Pareto distributions
• A Gibbs sampler on the \(n\)-simplex
• Analysis of convergence rates of some Gibbs samplers on continuous state spaces
• A generalization of the classical occupancy problem
• Newton and the classical theory of probability
• A limit theorem for random coverings of a circle
• Classic problems of probability
• Random subcube intersection graphs. I: Cliques and covering
• scientific article; zbMATH DE number 5955827 (Why is no real title available?)
• The self-power map and collecting all residue classes
• Omnibus sequences, coupon collection, and missing word counts
• The Prisoner's Dilemma
• The siblings of the coupon collector
• Reaching consensus on a connected graph
• The forgetfulness of balls and bins
• Speed and concentration of the covering time for structured coupon collectors
• Two Poisson limit theorems for the coupon collector's problem with group drawings
• Some limit theorems for heights of random walks on a spider
• Maximum of exponential random variables, Hurwitz's zeta function, and the partition function
• Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
• Reconstruction of a Riemannian manifold from noisy intrinsic distances
• Intersections of random sets
• Maximum likelihood estimation for discrete exponential families and random graphs
• The logarithmic Zipf law in a general urn problem
• When do envy-free allocations exist?
• A short note on the average maximal number of balls in a bin
• Computing absorbing times via fluid approximations
• On primes in arithmetic progressions
• A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
• The coupling method for inhomogeneous random intersection graphs.
• Finite representability of integers as 2-sums
• The number of collisions for the occupancy problem with unequal probabilities
• On the Recurrence of a Certain Chain
• Antiduality and Möbius monotonicity: generalized coupon collector problem
• Asymptotics for push on the complete graph
• 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
• Who started this rumor? Quantifying the natural differential privacy of gossip protocols
• Discrete uncertainty principles and sparse signal processing
• The clumsy coupon collector
• Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time
• Dixie cup problem in an interlacing process
• Entropy-driven cutoff phenomena
• Fast simulations of the multi-album collector
• On a generalisation of the coupon collector problem
• Detecting interactions in high-dimensional data using cross leverage scores
• The geometry of codes for random access in DNA storage
• Limit profile for the Bernoulli-Laplace urn via diffusions
• Asymptotic results for uniform group drawing in the coupon collector’s problem
• The VC-dimension of random subsets of finite groups
• Games of chance with multiple objectives
• A Poisson approximation in an urn model with indistinguishable balls

This page was built for publication:

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