Spatial cluster detection using the number of connected components of a graph - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2007

Spatial cluster detection using the number of connected components of a graph

Avner Bar-Hen
Michel Koskas
  • Fonction : Auteur
  • PersonId : 1202708

Résumé

The aim of this work is to detect spatial clusters. We link Erdös graph and Poisson point process. We give the probability distribution function (pdf) of the number of connected component for an Erdös graph and obtain the pdf of the number of cluster for a Poisson process. Using this result, we directly obtain a test for complete spatial randomness and also obtain the clusters that violates the CSR hypothesis. Border effects are computed. We illustrate our results on a tropical forest example.
Fichier principal
Vignette du fichier
rapport_P5_dec2007.pdf (225.92 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00197578 , version 1 (17-12-2007)

Identifiants

  • HAL Id : hal-00197578 , version 1

Citer

Avner Bar-Hen, Michel Koskas, Nicolas Picard. Spatial cluster detection using the number of connected components of a graph. 2007. ⟨hal-00197578⟩
200 Consultations
257 Téléchargements

Partager

More