Related papers: A study of counts of Bernoulli strings via conditi…
Consider an inhomogeneous Poisson process and let $D$ be the first of its epochs which is followed by a gap of size $\ell>0$. We establish a criterion for $D<\infty$ a.s., as well as for $D$ being long-tailed and short-tailed, and obtain…
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
We introduce the problem of Poisson sampling over joins: compute a sample of the result of a join query by conceptually performing a Bernoulli trial for each join tuple, using a non-uniform and tuple-specific probability. We propose an…
The Poisson process of order $i$ is a weighted sum of independent Poisson processes and is used to model the flow of clients in different services. In the paper below we study some extensions of this process, for different forms of the…
We study different fractional extensions of the Poisson process and generalized counting processes by introducing time-change represented by the inverse to the sums of stable and tempered stable subordinators. We state the governing…
Poisson processes and one-dimensional Poisson point processes satisfy three main properties: superposition, thinning, and conditioning. The proof of the first two relies on basic estimates involving the Poisson distribution that are also…
A Bernoulli scheme with unequal harmonic success probabilities is investigated, together with some of its natural extensions. The study includes the number of successes over some time window, the times to (between) successive successes and…
We analyze extensions of the Poisson process in which any interarrival time that exceeds a fixed value $r$ is counted as an interarrival of duration $r$. In the engineering application that initiated this work, one part is tested at a time,…
We extend the Dirichlet principle to non-reversible Markov processes on countable state spaces. We present two variational formulas for the solution of the Poisson equation or, equivalently, for the capacity between two disjoint sets. As an…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
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…
A novel multinomial theorem for commutative idempotents is shown to lead to new results about the moments, central moments, factorial moments, and their generating functions for any random variable $X = \sum_{i} Y_i $ expressible as a sum…
This note is motivated by connections between the online and offline problems of selecting a possibly long subsequence from a Poisson-paced sequence of uniform marks under either a monotonicity or a sum constraint. The offline problem with…
The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…
In this paper, we introduce and study fractional versions of three compound Poisson processes, namely, the Bell-Touchard process, the Poisson-logarithmic process and the generalized P\'olya-Aeppli process. It is shown that these processes…
For branching processes, the generating functions for limit distributions of so-called ratios of probabilities of rare events satisfy the Schr\"oder-type integral-functional equations. Excepting limited special cases, the corresponding…
Motivated by novel results in the theory of correlated sequences, we analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations). In our model, the probability for a unit bit in a binary string…
Given independent random variables $Y_1, \ldots, Y_n$ with $Y_i \in \{0,1\}$ we test the hypothesis whether the underlying success probabilities $p_i$ are constant or whether they are periodic with an unspecified period length of $r \ge 2$.…
We propose testing procedures for the hypothesis that a given set of discrete observations may be formulated as a particular time series of counts with a specific conditional law. The new test statistics incorporate the empirical…
The Poisson process is the most elementary continuous-time stochastic process that models a stream of repeating events. It is uniquely characterised by a single parameter called the rate. Instead of a single value for this rate, we here…