A Non-commutative Version of the Coupling from the Past Algorithm

Sissouno, Nadiem (2011)
A Non-commutative Version of the Coupling from the Past Algorithm.
Technische Universität Darmstadt
Ph.D. Thesis, Primary publication

Preview

PDF
Dissertation_Sissouno.pdf
Copyright Information: CC BY-NC-ND 2.5 Generic - Creative Commons, Attribution, NonCommercial, NoDerivs .
Download (1MB) | Preview

Item Type:

Ph.D. Thesis

Type of entry:

Primary publication

Title:

A Non-commutative Version of the Coupling from the Past Algorithm

Language:

English

Referees:

Kümmerer, Prof. Dr. Burkhard ; Maassen, Prof Dr. Hans

Date:

12 May 2011

Place of Publication:

Darmstadt

Publisher:

TU prints

Date of oral examination:

11 February 2011

Abstract:

We discuss the Coupling from the Past Algorithm within the context of synchronising words and reformulate it. Our findings are used to develop a non-commutative version of the algorithm and present simulations of non-commutative stochastic processes.

Alternative Abstract:

Alternative Abstract	Language
We discuss the Coupling from the Past Algorithm within the context of synchronising words and reformulate it. Our findings are used to develop a non-commutative version of the algorithm and present simulations of non-commutative stochastic processes.	English
Wir untersuchen den Zusammenhang zwischen synchchronsierenden Worten und dem Coupling from the Past Algorithmus und entwickeln darauf aufbauend eine altenative Formulierung. Mit Hilfe dieser Erkenntnisse formulieren wir eine nicht-kommutative Version und führen einige Simulationen für nicht-kommutative stochatische Prozesse durch.	German

Uncontrolled Keywords:

Coupling from the Past Algorithm, synchronising words, asymptotic completeness, non-commutative stochastic processes

Alternative keywords: