A completely random T-tessellation model and Gibbsian extensions

arXiv1302.1809MaRDI QIDQ6239455FDOQ6239455

Authors: Kiên Kiêu, Katarzyna Adamczyk-Chauvat, H. Monod, Radu Stoica 

Publication date: 7 February 2013

Abstract: In their 1993 paper, Arak, Clifford and Surgailis discussed a new model of random planar graph. As a particular case, that model yields tessellations with only T-vertices (T-tessellations). Using a similar approach involving Poisson lines, a new model of random T-tessellations is proposed. Campbell measures, Papangelou kernels and Georgii-Nguyen-Zessin formulae are translated from point process theory to random T-tessellations. It is shown that the new model shows properties similar to the Poisson point process and can therefore be considered as a completely random T-tessellation. Gibbs variants are introduced leading to models of random T-tessellations where selected features are controlled. Gibbs random T-tessellations are expected to better represent observed tessellations. As numerical experiments are a key tool for investigating Gibbs models, we derive a simulation algorithm of the Metropolis-Hastings-Green family.

This page was built for publication: A completely random T-tessellation model and Gibbsian extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239455)