Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Adjacency Method for Finding Connected Subsets of a Graph: An Application of Graph Theory to Spatial Statistics

From MaRDI portal
Publication:3625379
Jump to:navigation, search

DOI10.1080/03610910902807854zbMath1160.62048OpenAlexW2140405810MaRDI QIDQ3625379

Mark Hachey, Lan Huang, Jun Luo, Ram C. Tiwari

Publication date: 12 May 2009

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610910902807854


zbMATH Keywords

edgevertexcluster detectionconnected subsetflexible shaped spatial scan statistic


Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Applications of statistics to biology and medical sciences; meta analysis (62P10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)


Related Items

A spatial scan statistic on trends



Cites Work

  • A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
  • Modified Randomization Tests for Nonparametric Hypotheses
  • A spatial scan statistic
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3625379&oldid=17066329"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 06:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki