scispace - formally typeset
Open AccessJournal ArticleDOI

The number of distinct values of some multiplicity in sequences of geometrically distributed random variables

Reads0
Chats0
TLDR
In this paper, the authors consider a sequence of n geometric random variables and interpret the outcome as an urn model, and derive asymptotic equivalents for all (centered or uncentered) moments in a fairly automatic way.
Abstract
We consider a sequence of n geometric random variables and interpret the outcome as an urn model. For a given parameter m, we treat several parameters like what is the largest urn containing at least (or exactly) m balls, or how many urns contain at least m balls, etc. Many of these questions have their origin in some computer science problems. Identifying the underlying distributions as (variations of) the extreme value distribution, we are able to derive asymptotic equivalents for all (centered or uncentered) moments in a fairly automatic way.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws ∗

TL;DR: In this article, the authors collected facts about the number of occupied boxes in the classical balls-in-boxes occupancy scheme with infinitely many positive frequencies: equivalently, about the numbers of species represented in sam-ples from populations with infinitely-many species.
Journal ArticleDOI

Resilient dictionaries

TL;DR: A resilient dictionary is presented, implementing search, insert, and delete operations, and it is shown that any resilient comparison-based dictionary must take Ω(log n + Δ) expected time per search.
Journal ArticleDOI

Asymptotics of the Moments of Extreme-Value Related Distribution Functions

TL;DR: The goal is a purely mechanical computation of dominant and fluctuating components, with the help of a computer algebra system, to compute the asymptotic distribution and the moments of the random variables in question.
Journal ArticleDOI

On the variance of the number of occupied boxes

TL;DR: This work derives a simple necessary and sufficient condition for convergence of V"n to a finite limit, thus settling a long-standing question raised by Karlin in the seminal paper of 1967.
Journal ArticleDOI

Small counts in the infinite occupancy scheme

TL;DR: In this paper, the authors considered the classical occupancy scheme in which balls are thrown independently into infinitely many boxes, with given probability of hitting each of the boxes, and established joint normal approximation, as the number of balls goes to infinity, for the numbers of boxes containing any fixed number of counts, standardized in the natural way, assuming only that the variances of these counts all tend to infinity.
References
More filters
Book

Probability theory

Michel Loève
TL;DR: These notes cover the basic definitions of discrete probability theory, and then present some results including Bayes' rule, inclusion-exclusion formula, Chebyshev's inequality, and the weak law of large numbers.
Book

Probability Theory I

Michel Loève
Journal ArticleDOI

Probabilistic counting algorithms for data base applications

TL;DR: A class of probabilistic counting algorithms with which one can estimate the number of distinct elements in a large collection of data in a single pass using only a small additional storage and only a few operations per element scanned is introduced.
Book ChapterDOI

Skip Lists: A Probabilistic Alternative to Balanced Trees

TL;DR: This paper describes and analyzes skip lists and presents new techniques for analyzing probabilistic algorithms.
Journal ArticleDOI

Mellin transforms and asymptotics: harmonic sums

TL;DR: This survey presents a unified and essentially self-contained approach to the asymptotic analysis of a large class of sums that arise in combinatorial mathematics, discrete probabilistic models, and the average-case analysis of algorithms using the Mellin transform, a close relative of the integral transforms of Laplace and Fourier.