Ascending runs in dependent uniformly distributed random variables: application to wireless networks
From MaRDI portal
Publication:2270184
DOI10.1007/s11009-008-9088-0zbMath1195.60098arXiv0802.1387MaRDI QIDQ2270184
Bruno Sericola, Nathalie Mitton, Katy Paroux, Sébastien Tixeuil
Publication date: 15 March 2010
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.1387
68M10: Network design and communication in computer systems
68R05: Combinatorics in computer science
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
Cites Work
- Unnamed Item
- On the length of the longest increasing run in \(\mathbb{R}^d\)
- Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
- Runs of geometrically distributed random variables: A probabilistic analysis
- A note on runs of geometrically distributed random variables
- Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- Self-stabilizing systems in spite of distributed control
- Algorithmic Aspects of Wireless Sensor Networks