A Propp-Wilson perfect simulation scheme for processes with long memory

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 5 figures

Scientific paper

We describe a new "coupling from the past" algorithm for variable length Markov chains and random systems with perfect connections. This algorithm generalizes Propp and Wilson's simulation scheme, and improves on existing algorithms in that it requires much less restrictive conditions on the kernel to converge. It proves interesting even in the simple case of finite order Markov chains in terms of speed of convergence. Chains of variable or infinite order are an old objet of consideration that raised considerable interest recently because of its applications in applied probability, from information theory to bio-informatics and linguistics.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Propp-Wilson perfect simulation scheme for processes with long memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Propp-Wilson perfect simulation scheme for processes with long memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Propp-Wilson perfect simulation scheme for processes with long memory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-359700

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.