Related papers: Bernoulli Sieve
Slice sampling is an efficient Markov Chain Monte Carlo algorithm to sample from an unnormalized density with acceptance ratio always $1$. However, when the variable to sample is unbounded, its "stepping-out" heuristic works only locally,…
For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the…
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…
We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have…
A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this…
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomness; the statistical complexity gives the cost of predicting the process. We calculate, for the first time, the entropy rate and statistical…
A long sequence of tosses of a classical coin produces an apparently random bit string, but classical randomness is an illusion: the algorithmic information content of a classically-generated bit string lies almost entirely in the…
We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…
The purpose of this article is a set-indexed extension of the well-known Ornstein-Uhlenbeck process. The first part is devoted to a stationary definition of the random field and ends up with the proof of a complete characterization by its…
Consider a finite renewal process in the sense that interrenewal times are positive i.i.d. variables and the total number of renewals is a random variable, independent of interrenewal times. A finite point process can be obtained by…
We establish a quenched functional central limit theorem for the total number of components of random partitions induced by Chinese restaurant process with parameters $(\alpha,\theta), \alpha\in(0,1), \theta>-\alpha$. With $P_j$ denoting…
We study some properties of binary sequences generated by random substitutions of constant length. Specifically, assuming the alphabet $\{0,1\}$, we consider the following asymmetric substitution rule of length $k$: $0 \to \langle 0, 0,…
Suppose that $X_1,X_2,\ldots$ are independent identically distributed Bernoulli random variables with mean $p$. A Bernoulli factory for a function $f$ takes as input $X_1,X_2,\ldots$ and outputs a random variable that is Bernoulli with mean…
How intelligence arises from the brain is a central problem in science. A crucial aspect of intelligence is dealing with uncertainty -- developing good predictions about one's environment, and converting these predictions into decisions.…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
Let $\lambda$ be a partition of the positive integer $n$, selected uniformly at random among all such partitions. Corteel et al. (1999) proposed three different procedures of sampling parts of $\lambda$ at random. They obtained limiting…
A well-known result from Hardy and Ramanujan gives an asymptotic expression for the number of possible ways to express an integer as the sum of smaller integers. In this vein, we consider the general partitioning problem of writing an…
Let $f:[0,1)^d \to {\mathbb R}$ be an integrable function. An objective of many computer experiments is to estimate $\int_{[0,1)^d} f(x) dx$ by evaluating f at a finite number of points in [0,1)^d. There is a design issue in the choice of…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…