Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T21:46:38.869Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Coadapted Coupling for a Random Walk on the Hyper-Complete Graph

Part of: Markov processes Stochastic systems and control

Published online by Cambridge University Press:  30 January 2018

Stephen Connor
Stephen Connor*
Affiliation:
University of York
*
∗ Postal address: Department of Mathematics, University of York, York, YO10 5DD, UK. Email address: stephen.connor@york.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The problem of constructing an optimal coadapted coupling for a pair of symmetric random walks on Z 2 d 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 K n d , where K n is the complete graph with n vertices. Moreover, we show that although this coupling is not maximal for any n (i.e. it does not achieve equality in the coupling inequality), it does tend to a maximal coupling as n → ∞.

Keywords

Optimal couplingcoadaptedstochastic controlrandom walk on a groupcutoff phenomenon

MSC classification

Primary: 93E20: Optimal stochastic control
Secondary: 60J27: Continuous-time Markov processes on discrete state spaces

Information

Type
Research Article
Information
Journal of Applied Probability , Volume 50 , Issue 4 , December 2013 , pp. 1117 - 1130
Copyright
© Applied Probability Trust 

References

Aldous, D. (1983). {Random walks on finite groups and rapidly mixing Markov chains}. In Seminar on Probability XVII (Lecture Notes Math. 986), Springer, Berlin, pp. 243–297.Google Scholar
Burton, R. and Kovchegov, Y. (2011). {Mixing times via super-fast coupling}. Tech. Rep., Oregon State University.Google Scholar
Connor, S. B. and Jacka, S. (2008). {Optimal co-adapted coupling for the symmetric random walk on the hypercube}. J. Appl. Prob. 45, 703–713.Google Scholar
Diaconis, P. (1988). {Group Representations in Probability and Statistics} (Inst. Math. Statist. Lecture Notes Monogr. Ser. 11). Institute of Mathematical Statistics, Hayward, CA.Google Scholar
Diaconis, P. (1996). {The cutoff phenomenon in finite Markov chains}. Proc. Nat. Acad. Sci. USA. 93, 1659–1664.CrossRefGoogle ScholarPubMed
Diaconis, P., Graham, R. L. and Morrison, J. A. (1990). {Asymptotic analysis of a random walk on a hypercube with many dimensions}. Random Structures Algorithms 1, 51–72.CrossRefGoogle Scholar
Doeblin, W. (1938). {Exposé de la theorie des chaines constantes de Markov à un nombre fini d'états}. Rev. Math. Union Interbalkanique 2, 77–105.Google Scholar
Feller, V. (1971). An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edn. John Wiley, New York.Google Scholar
Griffeath, D. (1975). A maximal coupling for Markov chains. Z. Wahrscheinlichkeitsth. 31, 95–106.Google Scholar
Hsu, E. P. and Sturm, K.-T. (2003). {Maximal coupling of Euclidean Brownian motions}. Commun. Math. Statist. 1, 93–104.Google Scholar
Krylov, N. V. (1980). Controlled Diffusion Processes (Appl. Math. 14). Springer, New York.Google Scholar
Kuwada, K. (2007). {On uniqueness of maximal coupling for diffusion processes with a reflection}. J. Theoret. Prob. 20, 935–957.Google Scholar
Kuwada, K. (2009). {Characterization of maximal Markovian couplings for diffusion processes}. Electron. J. Prob. 14, 633–662.Google Scholar
Lindvall, T. (2002). Lectures on the Coupling Method. Dover Publications, Mineola, NY.Google Scholar
Matthews, P. (1987). Mixing rates for a random walk on the cube. SIAM J. Algebraic Discrete Methods 8, 746–752.CrossRefGoogle Scholar
Smith, A. (2011). {A Gibbs sampler on the N-simplex}. To appear in Ann. Appl. Prob. Google Scholar
Sverchkov, M. Y. and Smirnov, S. N. (1990). Maximal coupling of D-valued processes. Soviet Math. Dokl. 41, 352–354.Google Scholar