Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001 (Q2753395)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001 |
scientific article; zbMATH DE number 1668310
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001 |
scientific article; zbMATH DE number 1668310 |
Statements
4 November 2001
0 references
point process
0 references
Markov chain
0 references
Strauss process
0 references
Ising model
0 references
birth and death process
0 references
coupling from the past
0 references
Fill's interruptible algorithm
0 references
loss networks
0 references
Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001 (English)
0 references
The paper is devoted to the simulation from invariant distributions of spatial birth and death processes. In contrast to the classical Markov chain Monte Carlo approach at which the invariant measure is approximated by a distribution of the chain after long run, the author concentrates on the simulation perfectly from the invariant distribution. General theory of spatial birth and death processes is developed in the second chapter. It includes the construction of the processes, description of invariant measures and ergodicity theory. Point processes which can be obtained as invariant distributions of birth and death processes are described in the first chapter (e.g. Strauss processes, Ising models, loss networks). In the third chapter main algorithms of perfect simulation are considered, such as Propp and Wilson's coupling from the past algorithm, Fill's interruptible algorithm and backward-forward algorithm. The problem of user impatience bias is discussed. Applications to attractive spin systems and ferromagnetic Ising model are described.
0 references