.png){kind=icon}
返回
Efficient algorithms for constructing proper higher order spatial lag operators
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1467-9787.1996.tb01101.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 acid 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.
Keyword:
ELIMINATION
MODELS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
2.2K
被引数:
3.2K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容