Related papers: Univariate approximations in the infinite occupanc…

The paper is concerned with the equilibrium distributions of continuous-time density dependent Markov processes on the integers. These distributions are known typically to be approximately normal, and the approximation error, as measured in…

For all $n, \epsilon >0$, we show that the set of Poisson Binomial distributions on $n$ variables admits a proper $\epsilon$-cover in total variation distance of size $n^2+n \cdot (1/\epsilon)^{O(\log^2 (1/\epsilon))}$, which can also be…

The paper analyzes the probability distribution of the occupancy numbers and the entropy of a system at the equilibrium composed by an arbitrary number of non-interacting bosons. The probability distribution is derived both by tracing out…

Statistical inference on the mean of a Poisson distribution is a fundamentally important problem with modern applications in, e.g., particle physics. The discreteness of the Poisson distribution makes this problem surprisingly challenging,…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

In this paper, we consider the occupancy distribution for an open network of infinite server queues with multivariate batch arrivals following a non-homogeneous Poisson process, and general service time distributions. We derive a…

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 study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…

We study the number of visits to balls B_r(x), up to time t/mu(B_r(x)), for a class of non-uniformly hyperbolic dynamical systems, where mu is the SRB measure. Outside a set of `bad' centers x, we prove that this number is approximately…

We build and study a recursive algorithm based on the occupation measure of an Euler scheme with decreasing step for the numerical approximation of the quasistationary distribution (QSD) of an elliptic diffusion in a bounded domain. We…

Orthogonal polynomial approximations form the foundation to a set of well-established methods for uncertainty quantification known as polynomial chaos. These approximations deliver models for emulating physical systems in a variety of…

We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…

Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with each point of the process contained in exactly one…

In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…

We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…

An approximation scheme is a family of homogeneous subsets $(A_n)$ of a quasi-Banach space $X$, such that $A_1 \subsetneq A_2 \subsetneq ... \subsetneq X$, $A_n + A_n \subset A_{K(n)}$, and $\bar{\cup_n A_n} = X$. Continuing the line of…

Various best-choice problems related to the planar homogeneous Poisson process in finite or semi-infinite rectangle are studied. The analysis is largely based on properties of the one-dimensional box-area process associated with the…

Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…

This paper introduces a new class of optimal switching problems, where the player is allowed to switch at a sequence of exogenous Poisson arrival times, and the underlying switching system is governed by an infinite horizon backward…

The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…