adjacency matrix
Table of Contents
| 1 | 2 | 3 | |
| 1 | 0 | 1 | 0 |
| 2 | 1 | 0 | 1 |
| 3 | 0 | 1 | 0 |
- notation
- \(n\) - number of nodes
- \(x_i\) - node \(x_i\) in the network
- definition
- a \(n\) by \(n\) matrix \(A\), where \(A_{i,j}\) refers to the weight(or existence) of directed edge from node \(x_i\) to node \(x_j\)
Backlinks
diameters
the largest . To describe how well the network is connected
To find the diameter, take the adjacency matrix, add Identity matrix to it, and multiply it by itself. \((A+I)^k_{i,j}\) contains /number of ways to get from node \(i\) to node \(j\) with \(k\) movmentments, where each movement may move 0 or 1 step(as we have added the identity connections). When after a multiplication, the last 0 is gone, then \(k\) is the diameter