Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
From MaRDI portal
Publication:1401391
DOI10.1016/S0304-3975(03)00051-3zbMath1023.60060MaRDI QIDQ1401391
Guy Louchard, Prodinger, Helmut
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
asymptotic propertieslimiting trajectoriesascending runs of random variablesasymptotic Markov chaingeometrically distributed random variablespolyomino combinatorial structure
Geometric probability and stochastic geometry (60D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Related Items
The number of distinct values in a geometrically distributed sample ⋮ Ascending runs in dependent uniformly distributed random variables: application to wireless networks ⋮ A note on runs of geometrically distributed random variables ⋮ The perimeter of uniform and geometric words: a probabilistic analysis ⋮ Monotone runs of uniformly distributed integer random variables: 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
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- Approximate counting: a detailed analysis
- Probability approximations via the Poisson clumping heuristic
- Markov chain models - rarity and exponentiality
- On convergence rates in the central limit theorems for combinatorial structures
- Probabilistic analysis of some (un)directed animals
- Runs of geometrically distributed random variables: A probabilistic analysis
- Central and local limit theorems applied to asymptotic enumeration
- A Combinatorial Property of q-Eulerian Numbers
- 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