Pages that link to "Item:Q3285941"

The following pages link to On a classical problem of probability theory (Q3285941):

Displaying 50 items.

• Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
• Omnibus sequences, coupon collection, and missing word counts (Q352894) (← links)
• Some limit theorems for heights of random walks on a spider (Q501837) (← links)
• The coupling method for inhomogeneous random intersection graphs. (Q528984) (← links)
• Discrete uncertainty principles and sparse signal processing (Q667658) (← links)
• Entropy-driven cutoff phenomena (Q690635) (← links)
• Games of chance with multiple objectives (Q745535) (← links)
• A Poisson approximation in an urn model with indistinguishable balls (Q751704) (← links)
• Limit distributions for the problem of collecting pairs (Q1002561) (← links)
• Rates of convergence in certain limit theorem for extreme values (Q1043928) (← links)
• Poisson randomization in occupancy problems (Q1051976) (← links)
• An occupancy problem (Q1063312) (← links)
• Random coverings in several dimensions (Q1079276) (← links)
• Balls in constrained urns and Cantor-like sets (Q1282228) (← links)
• The maximum occupancy number in a simple urn model (Q1284066) (← links)
• Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
• On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints (Q1660636) (← links)
• On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes (Q1680802) (← links)
• On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model (Q1706299) (← links)
• Quantifying the survival uncertainty of Wolbachia-infected mosquitoes in a spatial model (Q1714916) (← links)
• The deficiency introduced by resampling (Q1788726) (← links)
• Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA (Q1989355) (← links)
• Sampling from a mixture of different groups of coupons (Q1995602) (← links)
• Collecting coupons is faster with friends (Q2117703) (← links)
• The polynomial learning with errors problem and the smearing condition (Q2168804) (← links)
• Uniform versus Zipf distribution in a mixing collection process (Q2273725) (← links)
• Incremental delay enumeration: space and time (Q2274091) (← links)
• Convergence of point processes associated with coupon collector's and Dixie cup problems (Q2274114) (← links)
• Estimating vocal repertoire size is like collecting coupons: a theoretical framework with heterogeneity in signal abundance (Q2351110) (← links)
• Coupon collector's problem and generalized Pareto distributions (Q2431578) (← links)
• A Gibbs sampler on the \(n\)-simplex (Q2443187) (← links)
• Analysis of convergence rates of some Gibbs samplers on continuous state spaces (Q2447735) (← links)
• A generalization of the classical occupancy problem (Q2548451) (← links)
• Newton and the classical theory of probability (Q2552104) (← links)
• A limit theorem for random coverings of a circle (Q2562654) (← links)
• Classic problems of probability (Q2889251) (← links)
• (Q3173881) (← links)
• The self-power map and collecting all residue classes (Q3450042) (← links)
• The Siblings of the Coupon Collector (Q4580423) (← links)
• Reaching consensus on a connected graph (Q4684846) (← links)
• The forgetfulness of balls and bins (Q4909203) (← links)
• Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
• Two poisson limit theorems for the coupon collector’s problem with group drawings (Q5014304) (← links)
• Maximum of exponential random variables, Hurwitz's zeta function, and the partition function (Q5022612) (← links)
• Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data (Q5037559) (← links)
• Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances (Q5037574) (← links)
• Intersections of random sets (Q5067215) (← links)
• Maximum likelihood estimation for discrete exponential families and random graphs (Q5101306) (← links)
• The logarithmic Zipf law in a general urn problem (Q5110222) (← links)
• When Do Envy-Free Allocations Exist? (Q5130903) (← links)