Let ${(g{n}){n\\geq 1}}$ be a sequence of independent and identically distributed (i.i.d.) ${d\\times d}$ real random matrices. For ${n\\geq 1}$ set ${G_n = g_n \\ldots g_1}$. Given any starting point ${x=\\mathbb R v\\in\\mathbb{P}^{d-1}}$, consider the Markov chain ${X_n^x \\mathbb G_n v }$ on projective space ${\\mathbb P^{d-1}}$ define norm cocycle by ${\\sigma(G_n, x)= \\log (|G_n v|/|v|)}...

Abstract In this paper, a new technique is introduced to obtain non-uniform Berry-Esseen bounds for normal and nonnormal approximations by unbounded exchangeable pairs. This does not rely on the concentration inequalities developed Chen Shao [4,5] can be applied quadratic forms general Curie-Weiss model.

as n → ∞. This is a deep extension of Hardy-Ramanujan Theorem (see [13]). In addition, the central limit theorem holds in a more general setting for additive functions. A formal treatment and proofs can be found in e.g. Durrett [7]. In terms of rate of convergence to the Gaussian distribution, i.e. Berry-Esseen bounds, Rényi and Turán [18] obtained the sharp rate of convergenceO(1/ √ log logn)....

Running head: Exponential Approximation by Exchangeable Pairs Version of 4/7/06 By Sourav Chatterjee and Jason Fulman Abstract: A general Berry-Esseen bound is obtained for the exponential distribution using Stein’s method of exchangeable pairs. As an application, an error term is derived for Hora’s result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential limit. This is...

Berry–Esseen-type bounds to the normal, based on zeroand size-bias couplings, are derived using Stein’s method. The zero biasing bounds are illustrated in an application to combinatorial central limit theorems in which the random permutation has either the uniform distribution or one that is constant over permutations with the same cycle type, with no fixed points. The size biasing bounds are a...