Chicago02: Network structure analysis_networkx

Jingyi Chen
2 min readDec 13, 2020

--

Network structure (graph) can help to analyze the relationship between data, especially in the analysis of social network data. It can find the association between nodes. This node can be any data type to be analyzed, such as people and their social properties, geographical space and its attributes. Edge is the connection bridge between nodes, which indicates the attribute strength of connection between nodes, such as the degree of communication between people and the distance between regions. In this experiment, we analyzed the spatial distance relationship and contact degree of each park in the Chicago park system. In the calculation, the key use of two libraries, one is the network structure diagram network x, used to establish the network diagram structure; the other is pysal library, which is used to calculate the distance weight. According to the calculated distance weight, the network diagram is established to find the spatial distribution relationship of the park.

At the same time, in order to observe the network structure more conveniently, extract the closely connected regions, the distance weight is greater than 96%, the maximum edge, and the length greater than 10 (°). According to the results of calculation, we can further analyze the characteristics of parks and the relationship between parks and urban environment.

In the process of calculating the park boundary form index, using the symphony library to write the formula, its structure is clear. The basic indexes such as shape, frac, s, l were calculated and analyzed by boxplot.

Calculation results

  1. Basic statistics

Write and calculate the basic index formulas such as SHAPE, FRAC, S,L, etc. Boxplot statistical analysis.

2. Graph of distance weighted network structure

Node is the center of the park, and the size represents the area. The edge is the first 93%, which has a larger distance weight, and the thickness of the line is the distance weight.

3. Edge of network structure

The maximum edge and the length greater than 10 (°) in the distance weight greater than 96% are extracted.

--

--