If T is the coalescence time of the Propp and Wilson [15], perfect simulation algorithm, the aim of this paper is to show that T depends on the second largest eigenvalue modulus of the transition matrix of the underlying Markov chain. This gives a relationship between the ordering based
on the speed of convergence to stationarity in total variation distance and the ordering defined in terms of speed of coalescence in perfect simulation.