Skip to main content
Cross Validated

Return to Question

edited title
Link
Ria George
Ria George
  • 1.5k
  • 2
  • 17
  • 31

Introduction to Markov process: How to prove that a process is Markov? Part 1

Fixed hyperlinks
Source Link
edit approved Sep 18, 2015 at 9:41
Dawny33
edit approved Sep 18, 2015 at 9:41
Dawny33
  • 2.3k
  • 1
  • 24
  • 37

In paperpaper: A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators [download link][1] under Section II it is mentioned that the sequence $\{x_n\}$ generated from the output of a chaotic discrete map is a Markov process.

The reference is also provided which is a book [download link][2]book. I have skimmed through the book and resources available in internet but could not find how to show or prove that the sequence is a Markov Process. In essence, do I need to show the Markov property of memory-less property ? But, I cannot understand how to show analytically. It will be of tremendous help if some directions for the proof and references where it exists are provided. Thank you

Any other example will also be helpful. [1]: http://arxiv.org/pdf/1211.1234.pdf [2]: http://medicinaycomplejidad.org/pdf/soporte/wiggins.pdf

In paper: A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators [download link][1] under Section II it is mentioned that the sequence $\{x_n\}$ generated from the output of a chaotic discrete map is a Markov process.

The reference is also provided which is a book [download link][2]. I have skimmed through the book and resources available in internet but could not find how to show or prove that the sequence is a Markov Process. In essence, do I need to show the Markov property of memory-less property ? But, I cannot understand how to show analytically. It will be of tremendous help if some directions for the proof and references where it exists are provided. Thank you

Any other example will also be helpful. [1]: http://arxiv.org/pdf/1211.1234.pdf [2]: http://medicinaycomplejidad.org/pdf/soporte/wiggins.pdf

In paper: A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators under Section II it is mentioned that the sequence $\{x_n\}$ generated from the output of a chaotic discrete map is a Markov process.

The reference is also provided which is a book. I have skimmed through the book and resources available in internet but could not find how to show or prove that the sequence is a Markov Process. In essence, do I need to show the Markov property of memory-less property ? But, I cannot understand how to show analytically. It will be of tremendous help if some directions for the proof and references where it exists are provided.

Any other example will also be helpful.

Source Link
Ria George
Ria George
  • 1.5k
  • 2
  • 17
  • 31

Introduction to Markov process: How to prove that a process is Markov?

In paper: A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators [download link][1] under Section II it is mentioned that the sequence $\{x_n\}$ generated from the output of a chaotic discrete map is a Markov process.

The reference is also provided which is a book [download link][2]. I have skimmed through the book and resources available in internet but could not find how to show or prove that the sequence is a Markov Process. In essence, do I need to show the Markov property of memory-less property ? But, I cannot understand how to show analytically. It will be of tremendous help if some directions for the proof and references where it exists are provided. Thank you

Any other example will also be helpful. [1]: http://arxiv.org/pdf/1211.1234.pdf [2]: http://medicinaycomplejidad.org/pdf/soporte/wiggins.pdf