
An Introduction to Relationship Matrices
\[\mathbf{M} = \begin{pmatrix} m_{11} & m_{12} & m_{13} \\ m_{21} & m_{22} & m_{23} \\ m_{31} & m_{32} & m_{33} \\ m_{41} & m_{42} & m_{43} \end{pmatrix}\]
| Age | Education | Income | |
|---|---|---|---|
| Alice | 25 | 16 | 55,000 |
| Bob | 42 | 12 | 48,000 |
| Charlie | 31 | 18 | 95,000 |
| David | 54 | 14 | 62,000 |
| Col 1 (Age) | Col 2 (Edu) | Col 3 (Inc) | |
|---|---|---|---|
| Row 1 (Alice) | \(b_{11} = 25\) | \(b_{12} = 16\) | \(b_{13} = 55\text{k}\) |
| Row 2 (Bob) | \(b_{21} = 42\) | \(b_{22} = 12\) | \(b_{23} = 48\text{k}\) |
| Row 3 (Charlie) | \(b_{31} = 31\) | \(b_{32} = 18\) | \(b_{33} = 95\text{k}\) |
| Row 4 (David) | \(b_{41} = 54\) | \(b_{42} = 14\) | \(b_{43} = 62\text{k}\) |
| Actor A | Actor B | Actor C | |
|---|---|---|---|
| Actor A | \(a_{11}\) | \(a_{12}\) | \(a_{13}\) |
| Actor B | \(a_{21}\) | \(a_{22}\) | \(a_{23}\) |
| Actor C | \(a_{31}\) | \(a_{32}\) | \(a_{33}\) |
–).
| Actor A | Actor B | Actor C | |
|---|---|---|---|
| Actor A | – | a12 | a13 |
| Actor B | a21 | – | a23 |
| Actor C | a31 | a32 | – |
Diagonal · Upper triangle · Lower triangle
| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | \(a_{12}\) | \(a_{13}\) | \(a_{14}\) | \(a_{15}\) |
| B | \(a_{21}\) | – | \(a_{23}\) | \(a_{24}\) | \(a_{25}\) |
| C | \(a_{31}\) | \(a_{32}\) | – | \(a_{34}\) | \(a_{35}\) |
| D | \(a_{41}\) | \(a_{42}\) | \(a_{43}\) | – | \(a_{45}\) |
| E | \(a_{51}\) | \(a_{52}\) | \(a_{53}\) | \(a_{54}\) | – |
We have 5 nodes: \(\{A, B, C, D, E\}\) with no arrowheads. Diagonals are blocked (--) because simple graphs have no self-loops.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | ? | ? | ? | ? |
| B | ? | – | ? | ? | ? |
| C | ? | ? | – | ? | ? |
| D | ? | ? | ? | – | ? |
| E | ? | ? | ? | ? | – |
Row A (sender) connects directly to B and C. Cells \(a_{AB}\) and \(a_{AC}\) are marked \(1\); others are \(0\).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | ? | – | ? | ? | ? |
| C | ? | ? | – | ? | ? |
| D | ? | ? | ? | – | ? |
| E | ? | ? | ? | ? | – |
Each undirected edge \(\{i, j\}\) maps directly to two symmetrical cell values in the matrix.

Since undirected ties are reciprocal, Column A must mirror Row A.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | ? | ? | ? |
| C | 1 | ? | – | ? | ? |
| D | 0 | ? | ? | – | ? |
| E | 0 | ? | ? | ? | – |
Row B connects to A, C, and D. \(a_{BA} = 1\) (filled!), \(a_{BC} = 1\), \(a_{BD} = 1\), \(a_{BE} = 0\).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | 1 | 1 | – | ? | ? |
| D | 0 | 1 | ? | – | ? |
| E | 0 | 0 | ? | ? | – |
Repeating for rows C, D, and E completes the matrix. Note the perfect bilateral mirror symmetry!

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | 1 | 1 | – | 0 | 1 |
| D | 0 | 1 | 0 | – | 1 |
| E | 0 | 0 | 1 | 1 | – |
The same 5 nodes \(\{A, B, C, D, E\}\) are used, but we now introduce directed arrows.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | ? | ? | ? | ? |
| B | ? | – | ? | ? | ? |
| C | ? | ? | – | ? | ? |
| D | ? | ? | ? | – | ? |
| E | ? | ? | ? | ? | – |
Node A sends arrows to B and C, but none to \(D\) or \(E\).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | ? | – | ? | ? | ? |
| C | ? | ? | – | ? | ? |
| D | ? | ? | ? | – | ? |
| E | ? | ? | ? | ? | – |
In a directed graph, each cell corresponds to a unique directional relationship (Sender \(\rightarrow\) Receiver).

Node B sends arrows to A, C, and D, but none to \(E\).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | ? | ? | – | ? | ? |
| D | ? | ? | ? | – | ? |
| E | ? | ? | ? | ? | – |
Node C sends an arrow only to E (\(C \rightarrow E\)). It has no arrows pointing to \(A, B,\) or \(D\).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | 0 | 0 | – | 0 | 1 |
| D | ? | ? | ? | – | ? |
| E | ? | ? | ? | ? | – |
Row D sends no arrows (receiver node) \(\rightarrow\) (0, 0, 0, --, 0). Row E sends only one arrow to D (\(E \rightarrow D\)) \(\rightarrow\) (0, 0, 0, 1, --).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | 0 | 0 | – | 0 | 1 |
| D | 0 | 0 | 0 | – | 0 |
| E | 0 | 0 | 0 | 1 | – |
--) for simple graphs.\[\mathbf{A} = \begin{pmatrix} \color{red}{a_{11}} & \color{blue}{a_{12}} & \color{blue}{a_{13}} \\ \color{green}{a_{21}} & \color{red}{a_{22}} & \color{blue}{a_{23}} \\ \color{green}{a_{31}} & \color{green}{a_{32}} & \color{red}{a_{33}} \end{pmatrix}\]
Undirected connections create matching mirror-image entries in both the upper (blue) and lower (green) triangles.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | 1 | 1 | – | 0 | 1 |
| D | 0 | 1 | 0 | – | 1 |
| E | 0 | 0 | 1 | 1 | – |
Directed connections break the mirror symmetry. Unreciprocated ties create a \(1\) in one triangle and a \(0\) in the other.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | – | 1 | 1 | 0 | 0 |
| B | 1 | – | 1 | 1 | 0 |
| C | 0 | 0 | – | 0 | 1 |
| D | 0 | 0 | 0 | – | 0 |
| E | 0 | 0 | 0 | 1 | – |
--).