.png){kind=icon}
Return
The K-function method on a network and its computational implementation
.png){kind=icon}
OA
AI
DOI：10.1111/j.1538-4632.2001.tb00448.x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes two statistical methods, called the network K-function method and the network cross K-function method, for analyzing the distribution of points on a network. First, by extending the ordinary K-function method defined on a homogeneous infinite plane with the Euclidean distance, the paper formulates the K-function method and the cross K-function method on a finite irregular network with the shortest-path distance. Second, the paper shows advantages of the network K-function methods, such as that the network K-function methods can deal with spatial point processes on a street network in a small district, and that they can exactly take the boundary effect into account. Third, the paper develops the computational implementation of the network K-functions, and shows that the computational order of the K-function method is O(n(Q)(2) log n(Q)) and that of the network cross K-function is Q(n(Q) log n(Q)) where n(Q) is the number of nodes of a network.
Keywords:
2ND-ORDER ANALYSIS
STATISTICAL-ANALYSIS
POINT PATTERNS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
706
Citations:
4.7K
Organization
No organization information available
Cited Papers
Large Area Thin-Film CdTe as the Next-Generation X-Ray Detector for Medical Imaging Applications
PREAI
ShareSaveShareSaveShareSaveImpact of Carbon Porosity on the Performance of Cathode Microporous Layers in Proton Exchange Membrane Fuel Cells.png)
Fuel Cells
Fuel CellsIF0
PREAI
ShareSaveShareSaveShareSave
View more