Efficient algorithms for constructing proper higher order spatial LAG operators

Luc Anselin, Oleg Smirnov

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

This paper extends the work of Blommestein and Koper (1992) - BK - on the construction of higher-order spatial lag operators without redundant and circular paths. For the case most relevant in spatial econometrics and spatial statistics, i.e., when contiguity between two observations (locations) is defined in a simple binary fashion, some deficiencies of the BK algorithms are outlined, corrected and an improvement suggested. In addition, three new algorithms are introduced and compared in terms of performance for a number of empirical contiguity structures. Particular attention is paid to a graph theoretic perspective on spatial lag operators and to the most efficient data structures for the storage and manipulation of spatial lags. The new forward iterative algorithm which uses a list form rather than a matrix to store the spatial lag information is shown to be several orders of magnitude faster than the BK solution. This allows the computation of proper higher-order spatial lags "on the fly" for even moderately large data sets such as 3,111 contiguous U. S. counties, which is not practical with the other algorithms.

Original languageEnglish (US)
Pages (from-to)67-89
Number of pages23
JournalJournal of Regional Science
Volume36
Issue number1
StatePublished - Feb 1996
Externally publishedYes

Fingerprint

econometrics
manipulation
statistics
matrix
performance
county

ASJC Scopus subject areas

  • Environmental Science (miscellaneous)
  • Development

Cite this

Efficient algorithms for constructing proper higher order spatial LAG operators. / Anselin, Luc; Smirnov, Oleg.

In: Journal of Regional Science, Vol. 36, No. 1, 02.1996, p. 67-89.

Research output: Contribution to journalArticle

Anselin, Luc ; Smirnov, Oleg. / Efficient algorithms for constructing proper higher order spatial LAG operators. In: Journal of Regional Science. 1996 ; Vol. 36, No. 1. pp. 67-89.
@article{96fb30ac94ac4532bdd493da69358d28,
title = "Efficient algorithms for constructing proper higher order spatial LAG operators",
abstract = "This paper extends the work of Blommestein and Koper (1992) - BK - on the construction of higher-order spatial lag operators without redundant and circular paths. For the case most relevant in spatial econometrics and spatial statistics, i.e., when contiguity between two observations (locations) is defined in a simple binary fashion, some deficiencies of the BK algorithms are outlined, corrected and an improvement suggested. In addition, three new algorithms are introduced and compared in terms of performance for a number of empirical contiguity structures. Particular attention is paid to a graph theoretic perspective on spatial lag operators and to the most efficient data structures for the storage and manipulation of spatial lags. The new forward iterative algorithm which uses a list form rather than a matrix to store the spatial lag information is shown to be several orders of magnitude faster than the BK solution. This allows the computation of proper higher-order spatial lags {"}on the fly{"} for even moderately large data sets such as 3,111 contiguous U. S. counties, which is not practical with the other algorithms.",
author = "Luc Anselin and Oleg Smirnov",
year = "1996",
month = "2",
language = "English (US)",
volume = "36",
pages = "67--89",
journal = "Journal of Regional Science",
issn = "0022-4146",
publisher = "Wiley-Blackwell",
number = "1",

}

TY - JOUR

T1 - Efficient algorithms for constructing proper higher order spatial LAG operators

AU - Anselin, Luc

AU - Smirnov, Oleg

PY - 1996/2

Y1 - 1996/2

N2 - This paper extends the work of Blommestein and Koper (1992) - BK - on the construction of higher-order spatial lag operators without redundant and circular paths. For the case most relevant in spatial econometrics and spatial statistics, i.e., when contiguity between two observations (locations) is defined in a simple binary fashion, some deficiencies of the BK algorithms are outlined, corrected and an improvement suggested. In addition, three new algorithms are introduced and compared in terms of performance for a number of empirical contiguity structures. Particular attention is paid to a graph theoretic perspective on spatial lag operators and to the most efficient data structures for the storage and manipulation of spatial lags. The new forward iterative algorithm which uses a list form rather than a matrix to store the spatial lag information is shown to be several orders of magnitude faster than the BK solution. This allows the computation of proper higher-order spatial lags "on the fly" for even moderately large data sets such as 3,111 contiguous U. S. counties, which is not practical with the other algorithms.

AB - This paper extends the work of Blommestein and Koper (1992) - BK - on the construction of higher-order spatial lag operators without redundant and circular paths. For the case most relevant in spatial econometrics and spatial statistics, i.e., when contiguity between two observations (locations) is defined in a simple binary fashion, some deficiencies of the BK algorithms are outlined, corrected and an improvement suggested. In addition, three new algorithms are introduced and compared in terms of performance for a number of empirical contiguity structures. Particular attention is paid to a graph theoretic perspective on spatial lag operators and to the most efficient data structures for the storage and manipulation of spatial lags. The new forward iterative algorithm which uses a list form rather than a matrix to store the spatial lag information is shown to be several orders of magnitude faster than the BK solution. This allows the computation of proper higher-order spatial lags "on the fly" for even moderately large data sets such as 3,111 contiguous U. S. counties, which is not practical with the other algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0029800062&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029800062&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029800062

VL - 36

SP - 67

EP - 89

JO - Journal of Regional Science

JF - Journal of Regional Science

SN - 0022-4146

IS - 1

ER -