Skip Navigation

Journal of the London Mathematical Society 1999 60(2):630-640; doi:10.1112/S0024610799008017
© 1999 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rogers, L. C. G.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The London Mathematical Society

Fastest Coupling of Random Walks

L. C. G. Rogers

School of Mathematical Sciences, University of Bath Bath BA2 7AY lcgr{at}maths.bath.ac.uk

Received 23 April 1997. Revision received 4 May 1998.

A new coupling of one-dimensional random walks is described which tries to control the coupling by keeping the separation of the two random walks of constant sign. It turns out that among such monotone couplings there is an optimal one-step coupling which maximises the second moment of the difference (assuming this is finite), and this coupling is ‘fast’ in the sense that for a random walk with a unimodal step distribution the coupling time achieved by using the new coupling at each step is stochastically no larger than any other coupling. This is applied to the case of symmetric unimodal distributions.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.