A Programming Approach to Minimizing and Maximizing Spatial Autocorrelation Statistics

摘要

A programming approach is presented for identifying the form of the weights matrix W which either minimizes or maximizes the value of Moran's spatial autocorrelation statistic for a specified vector of data values. Both nonlinear and linear programming solutions are presented. The former are necessary when the sum of the links in W is unspecified while the latter can be used if this sum is fixed. The approach is illustrated using data examined in previous studies for two variables measured for the counties of Eire. While programming solutions involving different sets of constraints are derived, all yield solutions in which the number of nonzero elements in W is considerably smaller than that in W defined using the contiguity relationships between the counties. In graph theory terms, all of the Ws derived define multicomponent graphs. Other characteristics of the derived Ws are also presented.