Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
6.7.1 Introduction
6. Spatial Analysis
Topological analysis
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
Metric analysis
Terminology
Graph
A graph is a set of nodes and their connecting links.
Subgraph:
A subgraph is a part of a graph. It consists of a subset of
nodes and links of the original graph.
6. Spatial Analysis
Connected graph
A connected graph is a graph whose nodes are connected
directly or indirectly with each other.
Disconnected graph
A disconnected graph is a graph in which some nodes are
not connected either directly or indirectly with each other.
A disconnected graph consists of a set of connected graphs,
which are called connected elements.
Figure: A graph and its subgraphs
6. Spatial Analysis
Planar graph
A planar graph is a graph in which links intersect only at
nodes.
Non-planar graph
A non-planar graph is a graph in which some links
intersect at points between nodes.
6. Spatial Analysis
6. Spatial Analysis
Complete graph
A complete graph is a graph in which every pair of nodes
is connected directly by one link.
6. Spatial Analysis
Circuit
A circuit is a set of links that starts from a node, visits
several nodes, and returns to the starting node. If a circuit
visits every node only once, the circuit is called a simple
circuit.
Loop
A loop is a link whose ends are the same node.
6. Spatial Analysis
Tree graph
A tree graph is a graph that does not contain a circuit.
Figure: Loops
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
1) index
n: Number of nodes
l: Number of links
c: Number of connected elements
A network is well-connected if l is relatively larger than n.
Connectivity measures thus evaluate l in comparison with
n.
index is defined by
=ln+c
A dense network has a large , which implies that nodes
are well connected.
Among connected graphs (c=1) a tree graph has the
smallest . This indicates that, given a set of nodes, tree
graphs are the most efficient graphs to connect all the
nodes.
6. Spatial Analysis
6. Spatial Analysis
2) index
0 2n 5
2n 5
ln+c
2n 5
0 1
6. Spatial Analysis
6. Spatial Analysis
3) index
4) index
index is defined by
l
=
n
3n 6
n
l
3n 6
3n 6
0
n
0 1
6. Spatial Analysis
6. Spatial Analysis
0.00
0.00
3.00
5.00
0.00
0.00
0.60
1.00
0.80
0.80
1.40
1.80
0.44
0.44
0.78
1.00
6. Spatial Analysis
6. Spatial Analysis
Terminology
3
3
3
2
6. Spatial Analysis
1) Knig number
4
4
4
3
4
2
6. Spatial Analysis
6. Spatial Analysis
6. Spatial Analysis
2) Simbel number
6. Spatial Analysis
17
12
25
18
20
13
13
In metric analysis, on the other hand, we consider not
only topological but also metric properties of a network,
say, the length, curvature, and shape of links and the flow
on the network.
6. Spatial Analysis
6. Spatial Analysis
Terminology
Notation
Length of a link
In topological analysis, the length of a link is always set to
one because it is the topological distance between adjacent
two nodes. In metric analysis, on the other hand, the
length of a link is defined by a metric measure such as the
Euclidean distance, network distance, or time distance.
n:
l:
d i:
Dij:
D:
fi:
6. Spatial Analysis
6. Spatial Analysis
1) index
The domain of is
1
If a graph is disconnected, we calculate for each
connected element separately and average the indices.
6. Spatial Analysis
6. Spatial Analysis
2) index
1 =
6. Spatial Analysis
6. Spatial Analysis
1) index
6. Spatial Analysis
6. Spatial Analysis
2) index
3) Degree of circuity
2 =
(l e )
6. Spatial Analysis
6.7.6 Application
10
6. Spatial Analysis
Homework Q.6.5
11