Skip to main content Accessibility help
×
Home

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

  • Stephen Connor (a1)

Abstract

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 → ∞.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

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

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

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

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

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

Copyright

Corresponding author

Postal address: Department of Mathematics, University of York, York, YO10 5DD, UK. Email address: stephen.connor@york.ac.uk

References

Hide All
[1] 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. 243297.
[2] Burton, R. and Kovchegov, Y. (2011). {Mixing times via super-fast coupling}. Tech. Rep., Oregon State University.
[3] Connor, S. B. and Jacka, S. (2008). {Optimal co-adapted coupling for the symmetric random walk on the hypercube}. J. Appl. Prob. 45, 703713.
[4] Diaconis, P. (1988). {Group Representations in Probability and Statistics} (Inst. Math. Statist. Lecture Notes Monogr. Ser. 11). Institute of Mathematical Statistics, Hayward, CA.
[5] Diaconis, P. (1996). {The cutoff phenomenon in finite Markov chains}. Proc. Nat. Acad. Sci. USA. 93, 16591664.
[6] 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, 5172.
[7] Doeblin, W. (1938). {Exposé de la theorie des chaines constantes de Markov à un nombre fini d'états}. Rev. Math. Union Interbalkanique 2, 77105.
[8] Feller, V. (1971). An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edn. John Wiley, New York.
[9] Griffeath, D. (1975). A maximal coupling for Markov chains. Z. Wahrscheinlichkeitsth. 31, 95106.
[10] Hsu, E. P. and Sturm, K.-T. (2003). {Maximal coupling of Euclidean Brownian motions}. Commun. Math. Statist. 1, 93104.
[11] Krylov, N. V. (1980). Controlled Diffusion Processes (Appl. Math. 14). Springer, New York.
[12] Kuwada, K. (2007). {On uniqueness of maximal coupling for diffusion processes with a reflection}. J. Theoret. Prob. 20, 935957.
[13] Kuwada, K. (2009). {Characterization of maximal Markovian couplings for diffusion processes}. Electron. J. Prob. 14, 633662.
[14] Lindvall, T. (2002). Lectures on the Coupling Method. Dover Publications, Mineola, NY.
[15] Matthews, P. (1987). Mixing rates for a random walk on the cube. SIAM J. Algebraic Discrete Methods 8, 746752.
[16] Smith, A. (2011). {A Gibbs sampler on the N-simplex}. To appear in Ann. Appl. Prob.
[17] Sverchkov, M. Y. and Smirnov, S. N. (1990). Maximal coupling of D-valued processes. Soviet Math. Dokl. 41, 352354.

Keywords

MSC classification

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

  • Stephen Connor (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed