A completely random T-tessellation model ...
Type de document :
Pré-publication ou Document de travail
Titre :
A completely random T-tessellation model and Gibbsian extensions
Auteur(s) :
Kiêu, Kiên [Auteur]
Unité de recherche Mathématiques et Informatique Appliquées [MIA]
Adamczyk-Chauvat, Katarzyna [Auteur]
Unité de recherche Mathématiques et Informatique Appliquées [MIA]
Monod, Hervé [Auteur]
Unité de recherche Mathématiques et Informatique Appliquées [MIA]
Stoica, Radu [Auteur]
Laboratoire Paul Painlevé - UMR 8524 [LPP]
Institut de Mécanique Céleste et de Calcul des Ephémérides [IMCCE]
Unité de recherche Mathématiques et Informatique Appliquées [MIA]
Adamczyk-Chauvat, Katarzyna [Auteur]
Unité de recherche Mathématiques et Informatique Appliquées [MIA]
Monod, Hervé [Auteur]
Unité de recherche Mathématiques et Informatique Appliquées [MIA]
Stoica, Radu [Auteur]
Laboratoire Paul Painlevé - UMR 8524 [LPP]
Institut de Mécanique Céleste et de Calcul des Ephémérides [IMCCE]
Mot(s)-clé(s) en anglais :
Stochastic geometry
random tessellation
Gibbs model
simulation
Metropolis-Hastings algorithm
random tessellation
Gibbs model
simulation
Metropolis-Hastings algorithm
Discipline(s) HAL :
Mathématiques [math]/Statistiques [math.ST]
Statistiques [stat]/Théorie [stat.TH]
Statistiques [stat]/Théorie [stat.TH]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Commentaire :
A revised version of this paper has been published in Spatial Statistics, 2013, volume 6, pages 118- 138.
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- simulation_ttessel.pdf
- Accès libre
- Accéder au document
- 1302.1809
- Accès libre
- Accéder au document