...
We can record who is connected to whom on a given social relation via an adjacency matrix. The adjacency matrix is a square, 1-mode matrix like this:
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="9a8e490f-e981-427e-9fee-1b8effaf2dd3"><ac:plain-text-body><![CDATA[ |
| A | B | C | D | E | F | G | [http://wiki.apache.org/hama-data/attachments/BigTableForGmail/attachments/graph.jpg] | ]]></ac:plain-text-body></ac:structured-macro> |
A |
| 1 | 0 | 1 | 0 | 0 | 1 | |||
B | 1 |
| 1 | 0 | 1 | 0 | 0 | |||
C | 1 | 1 |
| 1 | 1 | 0 | 0 | |||
D | 1 | 1 | 1 |
| 0 | 0 | 0 | |||
E | 0 | 0 | 0 | 1 |
| 1 | 0 | |||
F | 0 | 0 | 0 | 0 | 1 |
| 0 | |||
G | 1 | 1 | 0 | 0 | 0 | 0 |
|
...
If the matrix as a whole is called X, then the contents of any given cell are denoted xij. For example, in the matrix above, xij = 1, because A likes B. Note that this matrix is not quite symmetric (xij not always equal to xji).
...