Related papers: Stein's Method and Non-Reversible Markov Chains
Stein's method is used to approximate sums of discrete and locally dependent random variables by a centered and symmetric Binomial distribution. Under appropriate smoothness properties of the summands, the same order of accuracy as in the…
Let $(X_{i}, i\in J)$ be a family of locally dependent nonnegative integer-valued random variables, and consider the sum $W=\sum\nolimits_{i\in J}X_i$. We first establish a general error upper bound for $d_{TV}(W, M)$ using Stein's method,…
We completely characterize the class of univariate distributions allowing for a Stein kernel and illustrate our result by means of some concrete distributions. Moreover, we apply our findings to prove a quantitative version of the central…
We consider a Markov chain on $\mathbb{R}^d$ with invariant measure $\mu$. We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular…
Starting from the probability distribution of finite N-body systems, which maximises the Havrda--Charv\'at entropy, we build a Stein-type goodness-of-fit test. The Maxwell--Boltzmann distribution is exact only in the thermodynamic limit,…
As an application of Stein's method for Poisson approximation, we prove rates of convergence for the tail probabilities of two scan statistics that have been suggested for detecting local signals in sequences of independent random variables…
We apply the Stein-Chen method to problems from extreme value theory. On the one hand, the Stein-Chen method for Poisson approximation allows us to obtain bounds on the Kolmogorov distance between the law of the maximum of i.i.d. random…
Using a characterizing equation for the Beta distribution, Stein's method is applied to obtain bounds of the optimal order for the Wasserstein distance between the distribution of the scaled number of white balls drawn from a…
It is shown that the method of exchangeable pairs introduced by Stein [Approximate Computation of Expectations (1986) IMS, Hayward, CA] for normal approximation can effectively be used for translated Poisson approximation. Introducing an…
The purpose of this paper is to establish the convergence in law of the sequence of "midpoint" Riemann sums for a stochastic process of the form f'(W), where W is a Gaussian process whose covariance function satisfies some technical…
Friedman's chi-square test is a non-parametric statistical test for $r\geq2$ treatments across $n\ge1$ trials to assess the null hypothesis that there is no treatment effect. We use Stein's method with an exchangeable pair coupling to…
The problem of testing two simple hypotheses in a general probability space is considered. For a fixed type-I error probability, the best exponential decay rate of the type-II error probability is investigated. In regular asymptotic cases…
The purpose of this paper is to synthesize the approaches taken by Chatterjee-Meckes and Reinert-R\"ollin in adapting Stein's method of exchangeable pairs for multivariate normal approximation. The more general linear regression condition…
We establish non-asymptotic error bounds for the classical Maximal Likelihood Estimation of the transition matrix of a given Markov chain. Meanwhile, in the reversible case, we propose a new reversibility-preserving online Symmetric…
Markov chain Monte Carlo algorithms are invaluable tools for exploring stationary properties of physical systems, especially in situations where direct sampling is unfeasible. Common implementations of Monte Carlo algorithms employ…
We present, in a unified way, a Stein methodology for infinitely divisible laws (without Gaussian component) having finite first moment. Based on a correlation representation, we obtain a characterizing non-local Stein operator which boils…
The tail chain of a Markov chain can be used to model the dependence between extreme observations. For a positive recurrent Markov chain, the tail chain aids in describing the limit of a sequence of point processes $\{N_n,n\geq1\}$,…
This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving…
We present a Markov chain example where non-reversibility and an added edge jointly improve mixing time: when a random edge is added to a cycle of $n$ vertices and a Markov chain with a drift is introduced, we get mixing time of…
Suppose that $\{X_t,\,t\ge0\}$ is a non-stationary Markov process, taking values in a Polish metric space $E$. We prove the law of large numbers and central limit theorem for an additive functional of the form $\int_0^T\psi(X_s)ds$,…