Related papers: Limiting behaviour of pattern counts in biased bin…
An inhomogeneous first--order integer--valued autoregressive (INAR(1)) process is investigated, where the autoregressive type coefficient slowly converges to one. It is shown that the process converges weakly to a Poisson or a compound…
Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown…
We show that for planar dispersing billiards the return times distribution is, in the limit, Poisson for metric balls almost everywhere w.r.t. the SRB measure. Since the Poincar\'e return map is piecewise smooth but becomes singular at the…
Individual neurons often produce highly variable responses over nominally identical trials, reflecting a mixture of intrinsic "noise" and systematic changes in the animal's cognitive and behavioral state. Disentangling these sources of…
The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…
Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component…
Let $A$ be an $n\times n$ matrix with iid entries where $A_{ij} \sim \mathrm{Ber}(p)$ is a Bernoulli random variable with parameter $p = d/n$. We show that the empirical measure of the eigenvalues converges, in probability, to a…
The model of binary aggregation with constant kernel is subjected to stochastic resetting: aggregates of any size explode into monomers at independent stochastic times. These resetting times are Poisson distributed, and the rate of the…
We study pattern densities in binary sequences, finding optimal limit sequences with fixed pattern densities.
There has been a resurgence of interest in incomplete U-statistics that only sum over a subset of kernel evaluations, due to their computational efficiency and asymptotic normality which can be leveraged to quantify the uncertainty of…
Neural computations arising from myriads of interactions between spiking neurons can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this…
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…
We study the facilitated totally asymmetric exclusion process on the one dimensional integer lattice. We investigate the invariant measures and the limiting behavior of the process. We mainly derive the limiting distribution of the process…
We study sums of independent random variables that take values $0$, $1/2$, or $1$. We show that the probability mass function of the sum splits into two interleaved parts: one supported on the integers and the other supported on the…
Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…
Given a periodic point $\omega$ in a $\psi$-mixing shift with countable alphabet, the sequence $\{S_{n}\}$ of random variables counting the number of multiple returns to shrinking cylindrical neighborhoods of $\omega$ is considered.…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
We prove that the reverse characteristic polynomial $\det(I_n - zA_n)$ of a random $n \times n$ matrix $A_n$ with iid $\mathrm{Bernoulli}(d/n)$ entries converges in distribution towards the random infinite product $\prod_{\ell =…
We introduce a nonasymptotic framework for sub-Poisson distributions with moment generating function dominated by that of a Poisson distribution. At its core is a new notion of optimal sub-Poisson variance proxy, analogous to the variance…
We consider finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…