Home > Search Results: keywords:"perfect simulation"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.02 seconds. 
Perfect simulation in stochastic geometry
 Sadil, Antonín ; Prokešová, Michaela (advisor) ; Beneš, Viktor (referee)
Perfect simulations are methods, which convert suitable Markov chain Monte Carlo (MCMC) algorithms into algorithms which return exact draws from the target distribution, instead of approximations based on long-time convergence to equilibrium. In recent years a lot of various perfect simulation algorithms were developed. This work provides a unified exposition of some perfect simulation algorithms with applications to spatial point processes, especially to the Strauss process and area-interaction process. Described algorithms and their properties are compared theoretically and also by a simulation study.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English