Monotone runs of uniformly distributed integer random variables: A probabilistic analysis

DOI10.1016/j.tcs.2005.08.015zbMath1086.60007OpenAlexW1977963671MaRDI QIDQ2581352

Guy Louchard

Publication date: 10 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.015

zbMATH Keywords

Markov chainsuniform distributionpolyominoesMonotone increasing runs

Mathematics Subject Classification ID

Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)

Related Items (2)

Ascending runs in dependent uniformly distributed random variables: application to wireless networks ⋮ The perimeter of uniform and geometric words: a probabilistic analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mellin transforms and asymptotics: Harmonic sums
• Controlled non-uniform random generation of decomposable structures
• Asymptotics of the moments of extreme-value related distribution functions
• Approximate counting: a detailed analysis
• Markov chains with almost exponential hitting times
• Probability approximations via the Poisson clumping heuristic
• Markov chain models - rarity and exponentiality
• Probabilistic analysis of some (un)directed animals
• Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
• Runs of geometrically distributed random variables: A probabilistic analysis
• Special issue: Average-case analysis of algorithms
• Distinctness of compositions of an integer: A probabilistic analysis
• Probabilistic analysis of column-convex and directed diagonally-convex animals
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

This page was built for publication: Monotone runs of uniformly distributed integer random variables: A probabilistic analysis