Probabilistic Transforms for Combinatorial Urn Models

Authors:
O. Milenkovic;K. J. Compton
Affiliations:
Electrical and Computer Engineering Department, University of Colorado, Boulder, USA (e-mail: milenkov@schof.colorado.edu);Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, USA (e-mail: kjc@eecs.umich.edu)
Venue:
Combinatorics, Probability and Computing
Year:
2004

Citing 11
Cited 1

Some methods for computing component distribution probabilities in relational structures

Discrete Mathematics
Generating functionology

Generating functionology
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Analysis of algorithms: computational methods and mathematical tools

Analysis of algorithms: computational methods and mathematical tools
Log-concavity and related properties of the cycle index polynomials

Journal of Combinatorial Theory Series A
Asymptotic enumeration methods

Handbook of combinatorics (vol. 2)
Analysis of rerouting in circuit-switched networks

IEEE/ACM Transactions on Networking (TON)
Average Case Analysis of Algorithms on Sequences

Average Case Analysis of Algorithms on Sequences
The Binomial Transform and its Application to the Analysis of Skip Lists

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
General urn models with several types of balls and Gaussian limiting fields

Random Structures & Algorithms
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Boltzmann Samplers for the Random Generation of Combinatorial Structures

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present several probabilistic transforms related to classical urn models. These transforms render the dependent random variables describing the urn occupancies into independent random variables with appropriate distributions. This simplifies the analysis of a large number of problems for which a function under investigation depends on the urn occupancies. The approach used for constructing the transforms involves generating functions of combinatorial numbers characterizing the urn distributions. We also show, by using Tauberian theorems derived in this paper, that under certain simple conditions the asymptotic expressions of target functions in the transform domain and in the inverse–transform domain are identical. Therefore, asymptotic information about certain statistics can be obtained without evaluating the inverse transform.