The concept of a spatial weight is used in spatial analysis to describe neighbor relations between regions on a map. If location i {\displaystyle i} is a neighbor of location j {\displaystyle j} then w i j ≠ 0 {\displaystyle w_{ij}\neq 0} otherwise w i j = 0 {\displaystyle w_{ij}=0} . Usually (though not always) we do not consider a site to be a neighbor of itself so w i i = 0 {\displaystyle w_{ii}=0} . These coefficients are encoded in the spatial weight matrix
W = ( w 11 w 12 … w 1 N w 21 w 22 … w 2 N ⋮ ⋮ ⋮ ⋮ w N 1 w N 2 … w N N ) {\displaystyle W={\begin{pmatrix}w_{11}&w_{12}&\ldots &w_{1N}\\w_{21}&w_{22}&\ldots &w_{2N}\\\vdots &\vdots &\vdots &\vdots \\w_{N1}&w_{N2}&\ldots &w_{NN}\\\end{pmatrix}}}
Where N {\displaystyle N} is the number of sites under consideration. The spatial weight matrix is a key quantity in the computation of many spatial indices like Moran's I, Geary's C, Getis-Ord statistics and Join Count Statistics.
Contiguity-Based Weights
This approach considers spatial sites as nodes in a graph with links determined by a shared boundary or vertex. The elements of the spatial weight matrix are determined by setting w i j = 1 {\displaystyle w_{ij}=1} for all connected pairs of nodes i j {\displaystyle ij} with all the other elements set to 0. This makes the spatial weight matrix equivalent to the adjacency matrix of the corresponding network. It is common to row-normalize the matrix W {\displaystyle W} ,
w i j → w i j / ∑ j w i j {\displaystyle w_{ij}\rightarrow w_{ij}/\sum _{j}w_{ij}}
In this case the sum of all the elements of W {\displaystyle W} equals N {\displaystyle N} the number of sites.
There are three common methods for linking sites named after the chess pieces which make similar moves:
Rook: sites are neighbors if they share an edge Bishop: sites are neighbours if they share a vertex Queen: sites are neighbours if they share an edge or a vertex In some cases statistics can be quite different depending on the definition used, especially for discrete data on a grid. There are also other cases where the choice of neighbors is not obvious and can affect the outcome of the analysis. Bivand and Wong describe a situation where the value of spatial indices of association (like Moran's I) depend on the inclusion or exclusion of a ferry crossing between counties. There are also cases where regions meet in a tripoint or quadripoint where Rook and Queen neighborhoods can differ.
Distance-Based Weights Another way to define spatial neighbors is based on the distance between sites. One simple choice is to set w i j = 1 {\displaystyle w_{ij}=1} for every pair ( i , j ) {\displaystyle (i,j)} separated by a distance less than some threshold δ {\displaystyle \delta } . Cliff and Ord suggest the general form
… excerpt ends here. Continue reading the full article.


