Distinctness of compositions of an integer: A probabilistic analysis

A random composition of an integer \(N\) is a partition of \(N\) into positive summands assigning equal probability to all possible partitions. Asymptotic distributions are obtained for the number of distinct summands in the random partition and for various related quantities.

Recommendations

scientific article; zbMATH DE number 2046065
Measures of distinctness for random partitions and compositions of an integer
On the probability that certain compositions have the same number of parts
Expected number of distinct part sizes in a random integer composition
On the Multiplicity of Parts in a Random Composition of a Large Integer
On discrete value distribution of certain compositions
The distribution of run lengths in integer compositions
scientific article; zbMATH DE number 565962

Cites work

Analytical depoissonization and its applications
Approximate counting: a detailed analysis
Asymptotic Normality in the Classical Ball Problem
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
Brownian motion and algorithm complexity
Central and local limit theorems applied to asymptotic enumeration
Data Structures' Maxima
Discrete limit distributions in the problem of balls falling in cells with arbitrary probabilities
Exact and asymptotic distributions in digital and binary search trees
Expected number of distinct part sizes in a random integer composition
General combinatorial schemas: Gaussian limit distributions and exponential tails
scientific article; zbMATH DE number 1335043 (Why is no real title available?)
Inequalities for rare events in time-reversible Markov chains. II
Markov chain models - rarity and exponentiality
Measures of distinctness for random partitions and compositions of an integer
Mellin transforms and asymptotics: Harmonic sums
On Carlitz compositions
On convergence rates in the central limit theorems for combinatorial structures
Probabilistic counting algorithms for data base applications
Probability approximations via the Poisson clumping heuristic
Recurrence times and capacities for finite ergodic chains
Singularity Analysis of Generating Functions
The distribution of the number of summands in the partitions of a positive integer
The number of distinct part sizes in a random integer partition
Three problems in combinatorial asymptotics

Cited in

(30)

On the variance of the number of occupied boxes
The Bernoulli sieve
Runs of geometrically distributed random variables: A probabilistic analysis
Gap-free compositions and gap-free samples of geometric random variables
Average number of distinct part sizes in a random Carlitz composition
Local limit theorems for finite and infinite urn models
On gaps and unoccupied urns in sequences of geometrically distributed random variables
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
Expected number of distinct part sizes in a random integer composition
Smallest parts in compositions
scientific article; zbMATH DE number 6909290 (Why is no real title available?)
Random partitions with restricted part sizes
Record statistics in a random composition
Tight Markov chains and random compositions
scientific article; zbMATH DE number 2046065 (Why is no real title available?)
scientific article; zbMATH DE number 1753163 (Why is no real title available?)
Compositions and samples of geometric random variables with constrained multiplicities
scientific article; zbMATH DE number 2174610 (Why is no real title available?)
Longest run of equal parts in a random integer composition
Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
Some large polyominoes' perimeter: a stochastic analysis
The asymmetric leader election algorithm: number of survivors near the end of the game
Random compositions and monotone paths on a finite integer lattice: applications to ecological problems
The largest missing value in a composition of an integer
scientific article; zbMATH DE number 7674537 (Why is no real title available?)
On the probability that certain compositions have the same number of parts
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
On random trees obtained from permutation graphs
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
Rounding of continuous random variables and oscillatory asymptotics

This page was built for publication: Distinctness of compositions of an integer: A probabilistic analysis

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