Gap-free compositions and gap-free samples of geometric random variables

DOI10.1016/J.DISC.2005.02.008MaRDI QIDQ1781973zbMATH OpenOpenAlexFDO

Authors Arnold Knopfmacher, Paweł Hitczenko

Publication date 10 June 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.02.008

zbMATH Keywords

Integer compositionsAnalytic combinatoricsRandom compositionsSamples of geometric random variables

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Recommendations

• Gaps in samples of geometric random variables
• Compositions and samples of geometric random variables with constrained multiplicities
• Gaps in discrete random samples
• On gaps and unoccupied urns in sequences of geometrically distributed random variables
• Gaps in discrete random samples (extended abstract)

Cites work

• scientific article; zbMATH DE number 4162272 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 1512714 (Why is no real title available?)
• A limit theory for random skip lists
• Analysis of an asymmetric leader election algorithm
• Analysis of some new partition statistics
• Analytical depoissonization and its applications
• Average search and update costs in skip lists
• Combinatorics of geometrically distributed random variables: Left-to-right maxima
• Combinatorics of geometrically distributed random variables: Value and position of the \(r\)th left-to-right maximum
• Distinctness of compositions of an integer: A probabilistic analysis
• Gap‐Free Set Partitions
• Normal approximations of the number of records in geometrically distributed random variables
• On the Multiplicity of Parts in a Random Composition of a Large Integer
• Probabilistic counting algorithms for data base applications
• Special issue: Average-case analysis of algorithms
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(13)

• Gaps in discrete random samples
• Compositions and samples of geometric random variables with constrained multiplicities
• A simple sorting algorithm for compositions
• Samples of geometric random variables with multiplicity constraints
• The largest missing value in a sample of geometric random variables
• Part sizes of smooth supercritical compositional structures
• Random gap processes and asymptotically complete sequences
• On sets of integers with prescribed gaps
• Gaps in samples of geometric random variables
• On gaps and unoccupied urns in sequences of geometrically distributed random variables
• Gaps in discrete random samples (extended abstract)
• The largest missing value in a composition of an integer
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis

This page was built for publication: Gap-free compositions and gap-free samples of geometric random variables

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