Related papers: Polynomial birth-death distribution approximation …
Grouped data are commonly encountered in applications. The Bernstein polynomial model is proposed as an approximate model in this paper for estimating a univariate density function based on grouped data. The coefficients of the Bernstein…
The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive…
Barrier crossing is a widespread phenomenon across natural and engineering systems. While an abundant cross-disciplinary literature on the topic has emerged over the years, the stochastic underpinnings of the process are yet to be linked…
The Wasserstein barycenter is a geometric construct which captures the notion of centrality among probability distributions, and which has found many applications in machine learning. However, most algorithms for finding even an approximate…
Many important stochastic counting models can be written as general birth-death processes (BDPs). BDPs are continuous-time Markov chains on the non-negative integers and can be used to easily parameterize a rich variety of probability…
Efficient computation or approximation of Levenshtein distance, a widely-used metric for evaluating sequence similarity, has attracted significant attention with the emergence of DNA storage and other biological applications. Sequence…
Stein's method provides a way of bounding the distance of a probability distribution to a target distribution $\mu$. Here we develop Stein's method for the class of discrete Gibbs measures with a density $e^V$, where $V$ is the energy…
We discuss Stein's method for approximation by the stationary distribution of a single-birth Markov chain, in conjunction with stochastic monotonicity and similar assumptions. We use bounds on the increments of the solution of Poisson's…
The Wasserstein barycenter extends the Euclidean mean to the space of probability measures by minimizing the weighted sum of squared 2-Wasserstein distances. We develop a free-support algorithm for computing Wasserstein barycenters that…
New bounds on the total variation distance between the law of integer valued functionals of possibly non-symmetric and non-homogeneous infinite Rademacher sequences and the Poisson distribution are established. They are based on a…
We study the problem of distributional matrix completion: Given a sparsely observed matrix of empirical distributions, we seek to impute the true distributions associated with both observed and unobserved matrix entries. This is a…
We report some properties of heavy-tailed Sibuya-like distributions related to thinning, self-decomposability and branching processes. Extension of the thinning operation of on-negative integer-valued random variables to scaling by…
The Wasserstein distance is a metric on a space of probability measures that has seen a surge of applications in statistics, machine learning, and applied mathematics. However, statistical aspects of Wasserstein distances are bottlenecked…
In this work we study systems consisting of a group of moving particles. In such systems, often some important parameters are unknown and have to be estimated from observed data. Such parameter estimation problems can often be solved via a…
This paper studies new Lancaster characterizations of bivariate multivariate Poisson, negative binomial and normal distributions which have diagonal expansions in multivariate orthogonal polynomials. The characterizations extend classical…
This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset bounds, and their analogues in the randomized subsample…
The subject of this paper is the estimation of a probability measure on ${\mathbb R}^d$ from data observed with an additive noise, under the Wasserstein metric of order $p$ (with $p\geq 1$). We assume that the distribution of the errors is…
We show that the nearest-neighbor spacing distribution for a model that consists of random points uniformly distributed on a self-similar fractal is the Brody distribution of random matrix theory. In the usual context of Hamiltonian…
In this paper, we present new Poisson-type deviation inequalities for continuous-time Markov chains whose Wasserstein curvature or $\Gamma$-curvature is bounded below. Although these two curvatures are equivalent for Brownian motion on…
With the increasing availability of data objects in the form of probability distributions, there is a growing need for statistical methods tailored to distributional data. Distance measures, especially the pairwise distance matrix between…