GEOG 3LT3 Lecture Notes - Lecture 13: Network Planning And Design, Store Manager
2 May 2018
School
Department
Course
Professor
GEOG 3LT3
November 2,, 2016
Slides: Measurement of Networks 1: Network autocorrelation
C =
0100010 (=2 – see example* below)
1010000
0101110
0010100
0011010
1010101
0000010
C2=
2020101
0201100
2041211
0112120
1121311
0212140
1010101
C3=
0413260
4061312
1646691
3162522
2365471
6192729
0212140
-The power of the matrix gives you the various different ways in which two nodes can connect.
-If you sum across the rows, you have a value for the way in which a certain node can connect to
another node.
-Example*: for the first row of C, the value is 2 (1+1). This means that this node can reach 2
other nodes.
-The matrix allows you to obtain a summary of how many different ways nodes can reach other
nodes. This gives you a measure of connectivity. All of the possible nodes can be included within
a matrix.
Last Class:
Problem of Dominance
find more resources at oneclass.com
find more resources at oneclass.com
Document Summary
The power of the matrix gives you the various different ways in which two nodes can connect. If you sum across the rows, you have a value for the way in which a certain node can connect to another node. Example*: for the first row of c, the value is 2 (1+1). This means that this node can reach 2 other nodes. The matrix allows you to obtain a summary of how many different ways nodes can reach other nodes. All of the possible nodes can be included within a matrix. Matrix t = the summation of c to the power of k. This is the shortest path between two nodes. To calculate the matrix of t you must use the summation (3) of c to the power of k. this is equal to c + c2 + c3 (as listed above). This is the sum of the 3 c"s to give you matrix t.
