Related papers: Limiting behaviour of pattern counts in biased bin…

Let $\gamma_{n}= O (\log^{-c}n)$ and let $\nu$ be the infinite product measure whose $n$-th marginal is Bernoulli$(1/2+\gamma_{n})$. We show that $c=1/2$ is the threshold, above which $\nu$-almost every point is simply Poisson generic in…

We say that a string of length $d$ occurs, in a Bernoulli sequence, if a success is followed by exactly $(d-1)$ failures before the next success. The counts of such $d$-strings are of interest, and in specific independent Bernoulli…

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

This paper presents a framework for binary autoregressive time series in which each observation is a Bernoulli variable whose success probability evolves with past outcomes and probabilities, in the spirit of GARCH-type dynamics,…

The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1...W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the…

One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…

We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…

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…

In this paper, we study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\sim N(0,1)$. We use a new technique in the derivation of the lower bound in…

Patterns provide a concise, syntactic way of describing a set of strings, but their expressive power comes at a price: a number of fundamental decision problems concerning (erasing) pattern languages, such as the membership problem and…

Sampling from a random discrete distribution induced by a `stick-breaking' process is considered. Under a moment condition, it is shown that the asymptotics of the sequence of occupancy numbers, and of the small-parts counts (singletons,…

We examine a generalization of the binomial distribution associated with a strictly increasing sequence of numbers and we prove its Poisson-like limit. Such generalizations might be found in quantum optics with imperfect detection. We…

We are motivated by problems that arise in a number of applications such as Online Marketing and explosives detection, where the observations are usually modeled using Poisson statistics. We model each observation as a Poisson random…

A Poisson Binomial distribution over $n$ variables is the distribution of the sum of $n$ independent Bernoullis. We provide a sample near-optimal algorithm for testing whether a distribution $P$ supported on $\{0,...,n\}$ to which we have…

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

This paper introduces a new discrete distribution suggested by curtailed sampling rules common in early-stage clinical trials. We derive the distribution of the smallest number of independent Bernoulli(p) trials needed in order to observe…

We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree…

We consider a Yule process until the total population reaches size $n\gg 1$, and assume that neutral mutations occur with high probability $1-p$ (in the sense that each child is a new mutant with probability $1-p$, independently of the…

Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as "percolation of words". We give a positive answer to their Open Problem 2: almost surely, all…

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…