An official website of the United States government
Except for about a half dozen papers, virtually all (co)authored by Griffith, the existing literature lacks much content about the interface between spatial optimization, a popular form of geographic analysis, and spatial autocorrelation, a fundamental property of georeferenced data. The popularp‐median location‐allocation problem highlights this situation: the empirical geographic distribution of demand virtually always exhibits positive spatial autocorrelation. This property of geospatial data offers additional overlooked information for solving such spatial optimization problems when it actually relates to their solutions. With a proof‐of‐concept outlook, this paper articulates connections between the well‐known Majority Theorem of the 1‐median minisum problem and local indices of spatial autocorrelation; the LISA statistics appear to be the more useful of these later statistics because they better embrace negative spatial autocorrelation. The relationship articulation outlined here results in the positing of a new proposition labeled the egalitarian theorem.
more »
« less
This content will become publicly available on January 1, 2026
A Majority Theorem for the Uncapacitated p = 2 Median Problem and Local Spatial Autocorrelation
The existing quantitative geography literature contains a dearth of articles that span spatial autocorrelation (SA), a fundamental property of georeferenced data, and spatial optimization, a popular form of geographic analysis. The well-known location–allocation problem illustrates this state of affairs, although its empirical geographic distribution of demand virtually always exhibits positive SA. This latent redundant attribute information alludes to other tools that may well help to solve such spatial optimization problems in an improved, if not better than, heuristic way. Within a proof-of-concept perspective, this paper articulates connections between extensions of the renowned Majority Theorem of the minisum problem and especially the local indices of SA (LISA). The relationship articulation outlined here extends to the p = 2 setting linkages already established for the p = 1 spatial median problem. In addition, this paper presents the foundation for a novel extremely efficient p = 2 algorithm whose formulation demonstratively exploits spatial autocorrelation.
more »
« less
- Award ID(s):
- 1951344
- PAR ID:
- 10589008
- Publisher / Repository:
- MDPI
- Date Published:
- Journal Name:
- Mathematics
- Volume:
- 13
- Issue:
- 2
- ISSN:
- 2227-7390
- Page Range / eLocation ID:
- 249
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Both historically and in terms of practiced academic organization, the anticipation should be that a flourishing synergistic interface exists between statistics and operations research in general, and between spatial statistics/econometrics and spatial optimization in particular. Unfortunately, for the most part, this expectation is false. The purpose of this paper is to address this existential missing link by focusing on the beneficial contributions of spatial statistics to spatial optimization, via spatial autocorrelation (i.e., dis/similar attribute values tend to cluster together on a map), in order to encourage considerably more future collaboration and interaction between contributors to their two parent bodies of knowledge. The key basic statistical concept in this pursuit is the median in its bivariate form, with special reference to the global and to sets of regional spatial medians. One-dimensional examples illustrate situations that the narrative then extends to two-dimensional illustrations, which, in turn, connects these treatments to the spatial statistics centrography theme. Because of computational time constraints (reported results include some for timing experiments), the summarized analysis restricts attention to problems involving one global and two or three regional spatial medians. The fundamental and foundational spatial, statistical, conceptual tool employed here is spatial autocorrelation: geographically informed sampling designs—which acknowledge a non-random mixture of geographic demand weight values that manifests itself as local, homogeneous, spatial clusters of these values—can help spatial optimization techniques determine the spatial optima, at least for location-allocation problems. A valuable discovery by this study is that existing but ignored spatial autocorrelation latent in georeferenced demand point weights undermines spatial optimization algorithms. All in all, this paper should help initiate a dissipation of the existing isolation between statistics and operations research, hopefully inspiring substantially more collaborative work by their professionals in the future.more » « less
-
Geographic information systems deal with spatial data and its analysis. Spatial data contains many attributes with location information. Spatial autocorrelation is a fundamental concept in spatial analysis. It suggests that similar objects tend to cluster in geographic space. Hotspots, an example of autocorrelation, are statistically significant clusters of spatial data. Other autocorrelation measures like Moran’s I are used to quantify spatial dependence. Large scale spatial autocorrelation methods are compute- intensive. Fast methods for hotspots detection and analysis are crucial in recent times of COVID-19 pandemic. Therefore, we have developed parallelization methods on heterogeneous CPU and GPU environments. To the best of our knowledge, this is the first GPU and SIMD-based design and implementation of autocorrelation kernels. Earlier methods in literature introduced cluster-based and MapReduce-based parallelization. We have used Intrinsics to exploit SIMD parallelism on x86 CPU architecture. We have used MPI Graph Topology to minimize inter-process communication. Our benchmarks for CPU/GPU optimizations gain up to 750X relative speedup with a 8 GPU setup when compared to baseline sequential implementation. Compared to the best implementation using OpenMP + R-tree data structure on a single compute node, our accelerated hotspots benchmark gains a 25X speedup. For real world US counties and COVID data evolution calculated over 500 days, we gain up to 110X speedup reducing time from 33 minutes to 0.3 minutes.more » « less
-
This paper compares different distributed control approaches which enable a team of robots search for and track an unknown number of targets. The robots are equipped with sensors which have a limited field of view (FoV) and they are required to explore the environment. The team uses a distributed formulation of the Probability Hypothesis Density (PHD) filter to estimate the number and the position of the targets. The resulting target estimate is used to select the subsequent search locations for each robot. This paper compares Lloyd’s algorithm, a traditional method for distributed search, with two typical stochastic optimization methods: Particle Swarm Optimization (PSO) and Simulated Annealing (SA). This paper presents novel formulations of PSO and SA to solve the multi-target tracking problem, which more effectively trade off between exploration and exploitation. Simulations demonstrate that the use of these stochastic optimization techniques improves coverage of the search space and reduces the error in the target estimates compared to the baseline approach.more » « less
-
Abstract Disease mapping is an important statistical tool used by epidemiologists to assess geographic variation in disease rates and identify lurking environmental risk factors from spatial patterns. Such maps rely upon spatial models for regionally aggregated data, where neighboring regions tend to exhibit similar outcomes than those farther apart. We contribute to the literature on multivariate disease mapping, which deals with measurements on multiple (two or more) diseases in each region. We aim to disentangle associations among the multiple diseases from spatial autocorrelation in each disease. We develop multivariate directed acyclic graphical autoregression models to accommodate spatial and inter‐disease dependence. The hierarchical construction imparts flexibility and richness, interpretability of spatial autocorrelation and inter‐disease relationships, and computational ease, but depends upon the order in which the cancers are modeled. To obviate this, we demonstrate how Bayesian model selection and averaging across orders are easily achieved using bridge sampling. We compare our method with a competitor using simulation studies and present an application to multiple cancer mapping using data from the Surveillance, Epidemiology, and End Results program.more » « less
