Related papers: On Success runs of a fixed length defined on a $q$…
We study the distributions of waiting times in variations of the negative binomial distribution of order $k$. One variation apply different enumeration scheme on the runs of successes. Another case considers binary trials for which the…
We study the distributions of waiting times in variations of the $q$-sooner and later waiting time problem. One variation imposes length and frequency quotas on the runs of successes and failures. Another case considers binary trials for…
The negative binomial distribution NB$(k,r)$ of Type I is the probability distribution for a sequence of independent Bernoulli trials (with success parameter $p\in(0,1)$) with $r$ nonoverlapping success runs of length $\ge k$. We present a…
We determine the distributions of lengths of runs in random sequences of elements from a totally ordered set (total order) or partially ordered set (partial order). In particular, we produce novel formulae for the expected value, variance,…
We treat success runs of independent identically distributed Bernoulli trials (with success parameter $p$) distributed according to the Type II binomial distribution of order $k$. However, the success runs are separated by a gap $g\ge1$ (a…
$q$-analogs of special functions, including hypergeometric functions, play a central role in mathematics and have numerous applications in physics. In the theory of probability, $q$-analogs of various probability distributions have been…
The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…
From a mathematical and statistical point of view, a segment of a DNA strand can be viewed as a sequence of four-state (A, C, G, T) trials. We consider distributions of runs and patterns related to run lengths of multi-state sequences,…
Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in…
A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…
We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…
We give recurrences, generating functions and explicit exact expressions for the enumeration of fundamental quantities involving runs in binary strings. We first focus on enumerations concerning runs of ones, and we then analyse the same…
We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive…
The Poisson multinomial distribution (PMD) describes the distribution of the sum of $n$ independent but non-identically distributed random vectors, in which each random vector is of length $m$ with 0/1 valued elements and only one of its…
In this paper, we define and discuss $\mathcal{R}(p,q)$- deformations of basic univariate discrete distributions of the probability theory. We mainly focus on binomial, Euler, P\'olya and inverse P\'olya distributions. We discuss relevant…
We determine the probability distribution for relative projective objects in an exceptional sequence of type $A_n$ of any length. We show that these events (the $j$-th object in an exceptional sequence of length $k\le n$ being relatively…
We explore a unified $(k_1,k_2,\ldots,k_m)$-run in multi-state trials, examining its distributional properties and waiting time distribution. Our study reveals that this particular run serves as a generalization encompassing various…
The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are…
By using the matrix formulation of the two-step approach to the distributions of runs, a recursive relation and an explicit expression are derived for the generating function of the joint distribution of rises and falls for multivariate…
A $k$-modal probability distribution over the discrete domain $\{1,...,n\}$ is one whose histogram has at most $k$ "peaks" and "valleys." Such distributions are natural generalizations of monotone ($k=0$) and unimodal ($k=1$) probability…