The Annals of Applied Probability

On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted $U$-statistics

Yosef Rinott and Vladimir Rotar

Full-text: Open access


This paper deals with rates of convergence in the CLT for certain types of dependency. The main idea is to combine a modification of a theorem of Stein, requiring a coupling construction, with a dynamic set-up provided by a Markov structure that suggests natural coupling variables. More specifically, given a stationary Markov chain $X^{(t(}$, and a function $U = U(X^{(t)})$, we propose a way to study the proximity of U to a normal random variable when the state space is large.

We apply the general method to the study of two problems. In the first, we consider the antivoter chain $X^{(t)} = {X_i^{(t)}} _{i \epsilon \mathscr{V}}, t = 0, 1, \dots,$ where $\mathscr{V}$ is the vertex set of an n-vertex regular graph, and $X_i^{(t)} = +1 \text{or} -1$. The chain evolves from time t to $t + 1$ by choosing a random vertex i, and a random neighbor of it j, and setting $X_i^{(t+1)} = -X_j^{(t)}$ and $X_k^{(t+1)} = X_k^{(t)}$ for all $k \not= i$. For a stationary antivoter chain, we study the normal approximation of $U_n = U_n^{(t)} = \Sigma_i X_i^{(t)}$ for large n and consider some conditions on sequences of graphs such that $U_n$ is asymptotically normal, a problem posed by Aldous and Fill.

The same approach may also be applied in situations where a Markov chain does not appear in the original statement of a problem but is constructed as an auxiliary device. This is illustrated by considering weighted U-statistics. In particular we are able to unify and generalize some results on normal convergence for degenerate weighted U-statistics and provide rates.

Article information

Ann. Appl. Probab. Volume 7, Number 4 (1997), 1080-1105.

First available in Project Euclid: 29 January 2003

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60F05: Central limit and other weak theorems 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]
Secondary: 62E20: Asymptotic distribution theory 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Stein's method random graphs distance regularity Markov chains


Rinott, Yosef; Rotar, Vladimir. On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted $U$-statistics. Ann. Appl. Probab. 7 (1997), no. 4, 1080--1105. doi:10.1214/aoap/1043862425.

Export citation


  • Aldous, D. and Fill, J. A. (1994). Reversible Markov chains and random walks on graphs. Unpublished manuscript.
  • Barbour, A. D., Karo ´nski, M. and Ruci ´nski, A. (1989). A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Theory Ser. B 47 125-145.
  • Bhattachary a, R. N. and Ranga Rao, R. (1986). Normal Approximation and Asy mptotic Expansion. Krieger, Melbourne, FL.
  • Biggs, N. (1993). Algebraic Graph Theory. Cambridge Univ. Press.
  • Brouwer, A. E., Cohen, A. M. and Neumaier, A. (1989). Distance-Regular Graphs. Springer, Berlin.
  • Diaconis, P. (1977). The distribution of leading digits and uniform distribution mod 1. Ann. Probab. 5 72-81.
  • Diaconis, P. (1989). An example of Stein's method. Technical report, Dept. Statistics, Stanford Univ.
  • Donnelly, P. and Welsh, D. (1984). The antivoter problem: random 2-colourings of graphs. In Graph Theory and Combinatorics (B. Bollob´as, ed.) 133-144. Academic Press, New York.
  • G ¨otze, F. (1991). On the rate of convergence in the multivariate CLT. Ann. Probab. 19 724-739.
  • Griffeath, D. (1979). Additive and Cancellative Interacting Particle Sy stems. Lecture Notes in Math. 724. Springer, Berlin.
  • Hall, P. (1984). Central limit theorem for integrated square error of multivariate nonparametric density estimators. J. Multivariate Anal. 14 1-16.
  • Hoeffding, W. (1948). A class of statistics with asy mptotically normal distribution. Ann. Math. Statist. 19 293-325.
  • Horn, R. A. and Johnson, C. A. (1985). Matrix Analy sis. Cambridge Univ. Press.
  • Janson, S. (1984). The asy mptotic distribution of incomplete U-statistics. Z. Wahrsch. Verw. Gebiete 66 495-505.
  • Joag-Dev, K. and Proschan, F. (1983). Negative association of random variables, with applications. Ann. Statist. 11 286-295.
  • Lee, A. J. (1990). U-statistics: Theory and Practice. Dekker, New York.
  • Liggett, T. M. (1985). Interacting Particle Sy stems. Springer, New York.
  • Matloff, N. (1977). Ergodicity conditions for a dissonant voting model. Ann. Probab. 5 371-386.
  • Newman, C. M. (1984). Asy mptotic independence and limit theorems for positively and negatively dependent random variables. In Inequalities in Statistics and Probability (Y. L. Tong, ed.) 127-140. IMS, Hay ward, CA.
  • Nowicki, K. and Wierman, J. C. (1988). Subgraph counts in random graph using incomplete U-statistics methods. Discrete Math. 72 299-310.
  • O'Neil, K. and Redner, R. A. (1993). Asy mptotic distributions of weighted U-statistics of degree 2. Ann. Probab. 21 1159-1169.
  • Rinott, Y. and Rotar, V. (1996). A multivariate CLT for local dependence with n-1/2 log n rate, and applications to multivariate graph related statistics. J. Multivariate Anal. 56 333- 350.
  • Stein, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. Proc. Sixth Berkeley Sy mp. Math. Statist. Probab. 2 583-602. Univ. California Press, Berkeley.
  • Stein, C. (1986). Approximate Computation of Expectations. IMS, Hay ward, CA.