Coalescence time and second largest eigenvalue modulus in the monotone reversible case

2006 
If T is the coalescence time of the Propp and Wilson, 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. Key words and phrases: Peskun ordering, Covariance ordering, Effciency ordering, MCMC, time-invariance estimating equations, asymptotic variance, continuous time Markov chains.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    32
    References
    1
    Citations
    NaN
    KQI
    []