Refined Large Deviation Asymptotics for the Classical Occupancy Problem∗
نویسندگان
چکیده
In this paper refined large deviation asymptotics are derived for the classical occupancy problem. The asymptotics are established for a sequential filling experiment and an occupancy experiment. In the first case the random variable of interest is the number of balls required to fill a given fraction of the urns, while in the second a fixed number of balls are thrown and random variable is the fraction of nonempty urns.
منابع مشابه
Refined Asymptotics for Rate-Distortion using Gaussian Codebooks for Arbitrary Sources
The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance encoding is employed. We extend Lapidoth’s analysis in several directions in this paper. Firstly, we consider refined asymptotics. In particular, when the sou...
متن کاملLarge Deviation Principle for General Occupancy Models
We use process level large deviation analysis to obtain the rate function for a general family of occupancy problems. Our interest is the asymptotics of the empirical distributions of various quantities (such as the fraction of urns that contain a given number of balls). In the general setting, balls are allowed to land in a given urn depending on the urn’s contents prior to the throw. We discu...
متن کاملA Robust Scenario Based Approach in an Uncertain Condition Applied to Location-Allocation Distribution Centers Problem
The paper discusses the location-allocation model for logistic networks and distribution centers through considering uncertain parameters. In real-world cases, demands and transshipment costs change over the period of the time. This may lead to large cost deviation in total cost. Scenario based robust optimization approaches are proposed where occurrence probability of each scenario is not know...
متن کاملNotes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
Abstract: This paper collects facts about the number of occupied boxes in the classical balls-in-boxes occupancy scheme with infinitely many positive frequencies: equivalently, about the number of species represented in samples from populations with infinitely many species. We present moments of this random variable, discuss asymptotic relations among them and with related random variables, and...
متن کاملNon-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems
In this paper, we revisit two multi-terminal lossy source coding problems: the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994), and the multiple description coding problem with one semi-deterministic distortion measure, which we refer to as the Fu-Yeung problem (Fu and Yeung, 2002). For the ...
متن کامل