Related papers: Approximations for two-dimensional discrete scan s…
Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…
We investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For $\Omega \subset D = (0,1)^d$, with $d \geq 2$, we are given $n$ random i.i.d. points on $D$ whose membership in $\Omega$ is known. We…
Motivated by a neuroscience application we study the problem of statistical estimation of a high-dimensional covariance matrix with a block structure. The block model embeds a structural assumption: the population of items (neurons) can be…
Recently proposed generative models for discrete data, such as Masked Diffusion Models (MDMs), exploit conditional independence approximations to reduce the computational cost of popular Auto-Regressive Models (ARMs), at the price of some…
From the distributional characterizations that lie at the heart of Stein's method we derive explicit formulae for the mass functions of discrete probability laws that identify those distributions. These identities are applied to develop…
In this paper, we consider the sums of non-negative integer valued $m$-dependent random variables, and its approximation to the power series distribution. We first discuss some relevant results for power series distribution such as Stein…
In the standard stochastic block model for networks, the probability of a connection between two nodes, often referred to as the edge probability, depends on the unobserved communities each of these nodes belongs to. We consider a flexible…
Scale selection methods based on local extrema over scale of scale-normalized derivatives have been primarily developed to be applied sparsely --- at image points where the magnitude of a scale-normalized differential expression…
We analyze safety problems of complex systems using the methods of mathematical statistics for testing the output variables of a code simulating the operation of the system under consideration when the input variables are uncertain. We have…
Local dependence random graph models are a class of block models for network data which allow for dependence among edges under a local dependence assumption defined around the block structure of the network. Since being introduced by…
This work studies the estimation of many statistical quantiles under differential privacy. More precisely, given a distribution and access to i.i.d. samples from it, we study the estimation of the inverse of its cumulative distribution…
Discrete Markov random fields form a natural class of models to represent images and spatial data sets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and…
In this article we introduce associative Look-Up Tables. With their help, pseudo sums are correctly determined. The set of limit distributions in a pseudo-summation scheme of i.i.d. random variables is described. Also, two special cases…
We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…
The privacy loss distribution (PLD) provides a tight characterization of the privacy loss of a mechanism in the context of differential privacy (DP). Recent work has shown that PLD-based accounting allows for tighter $(\varepsilon,…
We study a multi-factor block model for variable clustering and connect it to regularized subspace clustering through a distributionally robust version of nodewise regression. To solve the latter problem, we derive a convex relaxation,…
We consider the closeness testing problem for discrete distributions. The goal is to distinguish whether two samples are drawn from the same unspecified distribution, or whether their respective distributions are separated in $L_1$-norm. In…
In this paper, explicit error bounds are derived in the approximation of rank $k$ projections of certain $n$-dimensional random vectors by standard $k$-dimensional Gaussian random vectors. The bounds are given in terms of $k$, $n$, and a…
This paper discusses how two classes of approximate computation algorithms can be adapted, in a modular fashion, to achieve exact statistical inference from differentially private data products. Considered are approximate Bayesian…
We explicitly quantify the empirically observed phenomenon that estimation under a stochastic block model (SBM) is hard if the model contains classes that are similar. More precisely, we consider estimation of certain functionals of random…