Ascending Runs in Dependent Uniformly Distributed Random Variables: Application to Wireless Networks

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is characterized by the fact that two successive random variables cannot take the same value. Using a Markov chain approach, we study the distribution of the maximal ascending run and we develop an algorithm to co...

Alternating Runs of Geometrically Distributed Random Variables

Run statistics about a sequence of independent geometrically distributed random variables has attracted some attention recently in many areas such as applied probability, reliability, statistical process control, and computer science. In this paper, we first study the mean and variance of the number of alternating runs in a sequence of independent geometrically distributed random variables. The...

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

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis

Generating uniformly distributed random networks.

The analysis of real networks taken from the biological, social, and physical sciences often requires a carefully posed statistical null-hypothesis approach. One common method requires comparing real networks to an ensemble of random matrices that satisfy realistic constraints in which each different matrix member is equiprobable. We discuss existing methods for generating uniformly distributed...