Abstract
In this paper we describe recent empirical work using perfect simulation to investigate how rates of convergence for Gibbs fields might depend on the interaction between sites and the kind of scanning used. We also give some experiment results on Kendall’s [8] perfect simulation method for area-interaction process, which show that the repulsive case could be quicker or slower than the attractive case for different choices of the parameters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cai, Y. (1999) How Rates of Convergence for Gibbs Fields Depend on the Interaction and the Kind of Scanning Used. Research report 360, Department of Statistics, University of Warwick, Coventry, CV4 7A1, UK
Cai, Y. & Kendall, W.S. (2002) Perfect Simulation for Correlated Poisson Random Variables Conditioned to be Positive. Statistics and Computing. To appear.
Fill, J. (1998) An Interruptible Algorithm for Exact Sampling via Markov Chains. Annals of Applied Probability, 8: 131–162.
Greenwood, P.E., McKeague, I.W. & Wefelmeyer, W. (1998) Information Bounds for Gibbs Samplers. The Annals of Statistics, 26, No.6:2128–2156.
Häggström, O. & Nelander, K. (1999) On Exact Simulation of Markov Random Fields Using Coupling from the Past. Scandinavian Journal of Statistics. 26 (3): 395–411.
Kendall, W.S. (1997a) On Some Weighted Boolean Models. In D. Jeulin, editor, Advances in Theory and Applications of Random Sets, pages 105–120, Singapore. World Scientific Publishing Company.
Kendall, W.S. (1997b) Perfect Simulation for Spatial Point Processes. In Bulletin ISI, 51st session proceedings, Istanbul (August 1997), volume 3, pages 163–166.
Kendall, W.S. (1998) Perfect Simulation for the Area-interaction Point Process. In L. Accardi and C.C. Heyde, editors, Probability Towards 2000, pages 218–234, New York. Springer.
Kendall, W.S. & Møller, J. (1999) Perfect Simulation of Point Processes Using Metropolis-Hastings Algorithms. Research report 347, Department of Statistics, University of Warwick.
Kendall, W.S. & Thönnes, E. (1999) Perfect Simulation in Stochastic Geometry. Pattern Recognition, 32 (9): 1569–1586.
Murdoch, D.J. & Green, P.J. (1998) Exact Sampling from a Continuous State Space. Scandinavian Journal of Statistics, 25 (3): 483–502.
Propp, J.G. & Wilson, D.B. (1996) Exact Sampling With Coupled Markov Chains and Applications to Statistical Mechanics. Random Structures and Algorithms, 9: 223–252.
Roberts, G.O. & Sahu, S.K. (1997) Updating Scheme, Correlation Structure, Blocking and Parameterization for Gibbs Sampler. J. R. Statist. Soc.B59, No. 2, 291–317.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Cai, Y. (2002). How Rates of Convergence for Gibbs Fields Depend on the Interaction and the Kind of Scanning Used. In: Hou, Z., Filar, J.A., Chen, A. (eds) Markov Processes and Controlled Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0265-0_31
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0265-0_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7968-3
Online ISBN: 978-1-4613-0265-0
eBook Packages: Springer Book Archive