Abstract
In this paper, we investigate a coupling Markov chain for the VKF method, where an excessively long run of the chain is stopped if the number of its steps exceeds the total length of the trajectories preliminarily computed for the chain. For this version of the algorithm, a submultiplicativity lemma is proved. In addition, a theorem on the probability with which the length of the trajectory exceeds a certain threshold is proved by reasoning a la Fekete’s lemma. Finally, we prove that the probabilities of the results yielded by the ordinary and stopped coupling Markov chains differ in terms of the total variation distance by an exponentially small quantity with respect to the number of preliminary runs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Automatic Documentation and Mathematical Linguistics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
