Optimal coadapted coupling for a random walk on the hyper-complete graph

@article{Connor2013OptimalCC,
  title={Optimal coadapted coupling for a random walk on the hyper-complete graph},
  author={Stephen B. Connor},
  journal={Journal of Applied Probability},
  year={2013},
  volume={50},
  pages={1117-1130}
}
  • Stephen B. Connor
  • Published 2013
  • Mathematics
  • Journal of Applied Probability
  • The problem of constructing an optimal coadapted coupling for a pair of symmetric random walks on Z2d was considered by Connor and Jacka (2008), and the existence of a coupling which is stochastically fastest in the class of all such coadapted couplings was demonstrated. In this paper we show how to generalise this construction to an optimal coadapted coupling for the continuous-time symmetric random walk on Knd, where Kn is the complete graph with n vertices. Moreover, we show that although… CONTINUE READING
    3 Citations
    Markovian Maximal Coupling of Markov Processes
    • 1
    Markovian Maximal Coupling of Markov Processes
    • 1
    • PDF
    Coupling, local times, immersions
    • 13
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Optimal co-adapted coupling for the symmetric random walk on the hypercube
    • 9
    • PDF
    Mixing rates for a random walk on the cube
    • 25
    • Highly Influential
    Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions
    • 148
    The cutoff phenomenon in finite Markov chains.
    • P. Diaconis
    • Mathematics, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 1996
    • 246
    • PDF
    Random walks on finite groups and rapidly mixing markov chains
    • 483
    • Highly Influential
    • PDF
    Maximal Coupling of Euclidean Brownian Motions
    • 23
    • PDF
    Controlled Diffusion Processes
    • 946
    A Gibbs sampler on the n-simplex.
    • 17
    • PDF