Related papers: Concentration inequalities from monotone couplings…
Continuous mixtures of distributions are widely employed in the statistical literature as models for phenomena with highly divergent outcomes; in particular, many familiar heavy-tailed distributions arise naturally as mixtures of…
We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…
We introduce the Space-Time Markov Chain Approximation (STMCA) for a general diffusion process on a finite metric graph $\Gamma$. The STMCA is a doubly asymmetric (in both time and space) random walk defined on a subdivisions of $\Gamma$,…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
We prove concentration inequalities of the form $P(Y \ge t) \le \exp(-B(t))$ for a random variable $Y$ with mean zero and variance $\sigma^2$ using a coupling technique from Stein's method that is so-called approximate zero bias couplings.…
Small subgraph counts can be used as summary statistics for large random graphs. We use the Stein-Chen method to derive Poisson approximations for the distribution of the number of subgraphs in the stochastic block model which are…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
Concentration inequalities are indispensable tools for studying the generalization capacity of learning models. Hoeffding's and McDiarmid's inequalities are commonly used, giving bounds independent of the data distribution. Although this…
General Berry-Esseen bounds are developed for the exponential distribution using Stein's method. As an application, a sharp error term is obtained for Hora's result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential…
Consider a connected graph $G=(E,V)$ with $N=|V|$ vertices. The main purpose of this paper is to explore the question of uniform sampling of a subtree of $G$ with $n$ nodes, for some $n\leq N$ (the spanning tree case correspond to $n=N$,…
We explore two aspects of geometric approximation via a coupling approach to Stein's method. Firstly, we refine precision and increase scope for applications by convoluting the approximating geometric distribution with a simple translation…
Chen [Ann. Appl. Probab. {\bf 11} (2001), 1242--1262] derived exact convergence rates in a central limit theorem and a local limit theorem for a supercritical branching Wiener process.We extend Chen's results to a branching random walk…
We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for…
This paper gives a review of concentration inequalities which are widely employed in non-asymptotical analyses of mathematical statistics in a wide range of settings, from distribution-free to distribution-dependent, from sub-Gaussian to…
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…
Bounds of the accuracy of the normal approximation to the distribution of a sum of independent random variables are improved under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second.…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…