Asymptotic behavior of an affine random recursion in defined by a matrix with an eigenvalue of size 1

In this paper we study the rate of convergence of the Markov chain , where A is an integer invertible matrix, and is a sequence of independent and identically distributed integer vectors. If A has an eigenvalue of size 1, then n=O(p2) steps are necessary and sufficient to have sampling from a nearly uniform distribution.