
Basic Operations, Transpose, and the Dyad Census


| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 1 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 1 | -- | 1 | 1 | 1 |
| D | 0 | 1 | 1 | -- | 1 | 0 |
| E | 1 | 0 | 1 | 1 | -- | 1 |
| F | 0 | 0 | 1 | 0 | 1 | -- |

| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 1 | 0 | 0 | 1 | 1 |
| B | 1 | -- | 1 | 0 | 0 | 0 |
| C | 0 | 1 | -- | 1 | 0 | 0 |
| D | 0 | 0 | 1 | -- | 1 | 1 |
| E | 1 | 0 | 0 | 1 | -- | 1 |
| F | 1 | 0 | 0 | 1 | 1 | -- |

\[\mathbf{P} + \mathbf{G} = \begin{pmatrix} 0 & 1 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 0 & 1 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 & 1 & 0 \end{pmatrix} + \begin{pmatrix} 0 & 1 & 0 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 & 0 & 1 \\ 1 & 0 & 0 & 1 & 1 & 0 \end{pmatrix}\]
\[\mathbf{P} + \mathbf{G} = \begin{pmatrix} 0+0 & 1+1 & 1+0 & 0+0 & 1+1 & 0+1 \\ 1+1 & 0+0 & 1+1 & 1+0 & 0+0 & 0+0 \\ 1+0 & 1+1 & 0+0 & 1+1 & 1+0 & 1+0 \\ 0+0 & 1+0 & 1+1 & 0+0 & 1+1 & 0+1 \\ 1+1 & 0+0 & 1+0 & 1+1 & 0+0 & 1+1 \\ 0+1 & 0+0 & 1+0 & 0+1 & 1+1 & 0+0 \end{pmatrix}\]
\[\mathbf{P} + \mathbf{G} = \begin{pmatrix} 0 & \mathbf{2} & 1 & 0 & \mathbf{2} & 1 \\ \mathbf{2} & 0 & \mathbf{2} & 1 & 0 & 0 \\ 1 & \mathbf{2} & 0 & \mathbf{2} & 1 & 1 \\ 0 & 1 & \mathbf{2} & 0 & \mathbf{2} & 1 \\ \mathbf{2} & 0 & 1 & \mathbf{2} & 0 & \mathbf{2} \\ 1 & 0 & 1 & 1 & \mathbf{2} & 0 \end{pmatrix}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 2 | 1 | 0 | 2 | 1 |
| B | 2 | -- | 2 | 1 | 0 | 0 |
| C | 1 | 2 | -- | 2 | 1 | 1 |
| D | 0 | 1 | 2 | -- | 2 | 1 |
| E | 2 | 0 | 1 | 2 | -- | 2 |
| F | 1 | 0 | 1 | 1 | 2 | -- |

\[\mathbf{1} - \mathbf{P} = 1 - \begin{pmatrix} - & 1 & 1 & 0 & 1 & 0 \\ 1 & - & 1 & 1 & 0 & 0 \\ 1 & 1 & - & 1 & 1 & 1 \\ 0 & 1 & 1 & - & 1 & 0 \\ 1 & 0 & 1 & 1 & - & 1 \\ 0 & 0 & 1 & 0 & 1 & - \end{pmatrix}\]
\[\mathbf{1} - \mathbf{P} = \begin{pmatrix} - & 1-1 & 1-1 & 1-0 & 1-1 & 1-0 \\ 1-1 & - & 1-1 & 1-1 & 1-0 & 1-0 \\ 1-1 & 1-1 & - & 1-1 & 1-1 & 1-1 \\ 1-0 & 1-1 & 1-1 & - & 1-1 & 1-0 \\ 1-1 & 1-0 & 1-1 & 1-1 & - & 1-1 \\ 1-0 & 1-0 & 1-1 & 1-0 & 1-1 & - \end{pmatrix}\]
\[\mathbf{1} - \mathbf{P} = \begin{pmatrix} - & 0 & 0 & 1 & 0 & 1 \\ 0 & - & 0 & 0 & 1 & 1 \\ 0 & 0 & - & 0 & 0 & 0 \\ 1 & 0 & 0 & - & 0 & 1 \\ 0 & 1 & 0 & 0 & - & 0 \\ 1 & 1 & 0 & 1 & 0 & - \end{pmatrix}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 0 | 1 | 0 | 1 |
| B | 0 | -- | 0 | 0 | 1 | 1 |
| C | 0 | 0 | -- | 0 | 0 | 0 |
| D | 1 | 0 | 0 | -- | 0 | 1 |
| E | 0 | 1 | 0 | 0 | -- | 0 |
| F | 1 | 1 | 0 | 1 | 0 | -- |

\[\mathbf{P} \circ \mathbf{G} = \begin{pmatrix} 0 & 1 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 \\ 1 & 1 & 0 & 1 & 1 & 1 \\ 0 & 1 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 & 1 & 0 \end{pmatrix} \circ \begin{pmatrix} 0 & 1 & 0 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 & 0 & 1 \\ 1 & 0 & 0 & 1 & 1 & 0 \end{pmatrix}\]
\[\mathbf{P} \circ \mathbf{G} = \begin{pmatrix} 0\times0 & 1\times1 & 1\times0 & 0\times0 & 1\times1 & 0\times1 \\ 1\times1 & 0\times0 & 1\times1 & 1\times0 & 0\times0 & 0\times0 \\ 1\times0 & 1\times1 & 0\times0 & 1\times1 & 1\times0 & 1\times0 \\ 0\times0 & 1\times0 & 1\times1 & 0\times0 & 1\times1 & 0\times1 \\ 1\times1 & 0\times0 & 1\times0 & 1\times1 & 0\times0 & 1\times1 \\ 0\times1 & 0\times0 & 1\times0 & 0\times1 & 1\times1 & 0\times0 \end{pmatrix}\]
\[\mathbf{P} \circ \mathbf{G} = \begin{pmatrix} 0 & \mathbf{1} & 0 & 0 & \mathbf{1} & 0 \\ \mathbf{1} & 0 & \mathbf{1} & 0 & 0 & 0 \\ 0 & \mathbf{1} & 0 & \mathbf{1} & 0 & 0 \\ 0 & 0 & \mathbf{1} & 0 & \mathbf{1} & 0 \\ \mathbf{1} & 0 & 0 & \mathbf{1} & 0 & \mathbf{1} \\ 0 & 0 & 0 & 0 & \mathbf{1} & 0 \end{pmatrix}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 1 | 0 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 0 | 0 | 0 |
| C | 0 | 1 | -- | 1 | 0 | 0 |
| D | 0 | 0 | 1 | -- | 1 | 0 |
| E | 1 | 0 | 0 | 1 | -- | 1 |
| F | 0 | 0 | 0 | 0 | 1 | -- |

The most basic operation on a matrix: add up its rows and columns.
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 1 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 1 | -- | 1 | 1 | 1 |
| D | 0 | 1 | 1 | -- | 1 | 0 |
| E | 1 | 0 | 1 | 1 | -- | 1 |
| F | 0 | 0 | 1 | 0 | 1 | -- |

| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 1 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 1 | -- | 1 | 1 | 1 |
| D | 0 | 1 | 1 | -- | 1 | 0 |
| E | 1 | 0 | 1 | 1 | -- | 1 |
| F | 0 | 0 | 1 | 0 | 1 | -- |
Row sums for every node:
| A | B | C | D | E | F |
|---|---|---|---|---|---|
| 3 | 3 | 5 | 3 | 4 | 2 |

Row sum of node C — add across row C, cell by cell:
\[a_{CA} + a_{CB} + a_{CC} + a_{CD} + a_{CE} + a_{CF}\] \[= \color{red}{1} + \color{red}{1} + 0 + \color{red}{1} + \color{red}{1} + \color{red}{1} = \mathbf{5}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 0 | -- | 1 | 1 | 0 |
| D | 0 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 0 | 0 | 1 | -- | 1 |
| F | 0 | 0 | 0 | 1 | 1 | -- |

Row sum of node B — add across row B, cell by cell:
\[a_{BA} + a_{BB} + a_{BC} + a_{BD} + a_{BE} + a_{BF}\] \[= \color{red}{1} + 0 + \color{red}{1} + \color{red}{1} + 0 + 0 = \mathbf{3}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 0 | -- | 1 | 1 | 0 |
| D | 0 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 0 | 0 | 1 | -- | 1 |
| F | 0 | 0 | 0 | 1 | 1 | -- |

Column sum of node D — add down column D, cell by cell:
\[a_{AD} + a_{BD} + a_{CD} + a_{DD} + a_{ED} + a_{FD}\] \[= 0 + \color{red}{1} + \color{red}{1} + 0 + \color{red}{1} + \color{red}{1} = \mathbf{4}\]
| A | B | C | D | E | F |
|---|---|---|---|---|---|
| 2 | 3 | 3 | 0 | 2 | 2 |
| A | B | C | D | E | F |
|---|---|---|---|---|---|
| 2 | 0 | 2 | 4 | 3 | 1 |

The transpose reverses the direction of every tie:
Example: - In \(\mathbf{A}\): A → B (row 1, col 2) = 1 - In \(\mathbf{A}^T\): B → A (row 2, col 1) becomes row 1, col 2 = 1 - The direction is reversed.
This is essential for finding mutual ties (cells where both \(a_{ij} = 1\) AND \(a_{ji} = 1\), which we can identify by comparing \(\mathbf{A}\) and \(\mathbf{A}^T\)).
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 0 | -- | 1 | 1 | 0 |
| D | 0 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 0 | 0 | 1 | -- | 1 |
| F | 0 | 0 | 0 | 1 | 1 | -- |
(0, 0, 1, 0, 1, 0) is Column 1 of \(\mathbf{A}^T\).| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 1 | 1 | 0 | 0 | 0 |
| B | 0 | -- | 0 | 0 | 0 | 0 |
| C | 1 | 1 | -- | 0 | 0 | 0 |
| D | 0 | 1 | 1 | -- | 1 | 1 |
| E | 1 | 0 | 1 | 0 | -- | 1 |
| F | 0 | 0 | 0 | 0 | 1 | -- |




| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 1 | 0 | -- | 1 | 1 | 0 |
| D | 0 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 0 | 0 | 1 | -- | 1 |
| F | 0 | 0 | 0 | 1 | 1 | -- |

\[\mathbf{M} = \mathbf{A} \circ \mathbf{A}^T = \begin{pmatrix} 0 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 \\ 0 & 0 & 0 & 1 & 1 & 0 \end{pmatrix} \circ \begin{pmatrix} 0 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 1 & 0 \end{pmatrix}\]
\[\mathbf{M} = \begin{pmatrix} 0\times0 & 0\times1 & 1\times1 & 0\times0 & 1\times0 & 0\times0 \\ 1\times0 & 0\times0 & 1\times0 & 1\times0 & 0\times0 & 0\times0 \\ 1\times1 & 0\times1 & 0\times0 & 1\times0 & 1\times0 & 0\times0 \\ 0\times0 & 0\times1 & 0\times1 & 0\times0 & 0\times1 & 0\times1 \\ 0\times1 & 0\times0 & 0\times1 & 1\times0 & 0\times0 & 1\times1 \\ 0\times0 & 0\times0 & 0\times0 & 1\times0 & 1\times1 & 0\times0 \end{pmatrix} = \begin{pmatrix} - & 0 & \mathbf{1} & 0 & 0 & 0 \\ 0 & - & 0 & 0 & 0 & 0 \\ \mathbf{1} & 0 & - & 0 & 0 & 0 \\ 0 & 0 & 0 & - & 0 & 0 \\ 0 & 0 & 0 & 0 & - & \mathbf{1} \\ 0 & 0 & 0 & 0 & \mathbf{1} & - \end{pmatrix}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 1 | 0 | 0 | 0 |
| B | 0 | -- | 0 | 0 | 0 | 0 |
| C | 1 | 0 | -- | 0 | 0 | 0 |
| D | 0 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 0 | 0 | 0 | -- | 1 |
| F | 0 | 0 | 0 | 0 | 1 | -- |

\[\mathbf{S} = \mathbf{A} \circ (\mathbf{1} - \mathbf{A}^T) = \begin{pmatrix} 0 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 \\ 0 & 0 & 0 & 1 & 1 & 0 \end{pmatrix} \circ \begin{pmatrix} - & 0 & 0 & 1 & 1 & 1 \\ 1 & - & 1 & 1 & 1 & 1 \\ 0 & 0 & - & 1 & 1 & 1 \\ 1 & 0 & 0 & - & 0 & 0 \\ 0 & 1 & 0 & 1 & - & 0 \\ 1 & 1 & 1 & 1 & 0 & - \end{pmatrix}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 0 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 0 |
| C | 0 | 0 | -- | 1 | 1 | 0 |
| D | 0 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 0 | 0 | 1 | -- | 0 |
| F | 0 | 0 | 0 | 1 | 0 | -- |

\[\mathbf{N} = (\mathbf{1} - \mathbf{A}) \circ (\mathbf{1} - \mathbf{A}^T) = \begin{pmatrix} - & 1 & 0 & 1 & 0 & 1 \\ 0 & - & 0 & 0 & 1 & 1 \\ 0 & 1 & - & 0 & 0 & 1 \\ 1 & 1 & 1 & - & 1 & 1 \\ 1 & 1 & 1 & 0 & - & 0 \\ 1 & 1 & 1 & 0 & 0 & - \end{pmatrix} \circ \begin{pmatrix} - & 0 & 0 & 1 & 1 & 1 \\ 1 & - & 1 & 1 & 1 & 1 \\ 0 & 0 & - & 1 & 1 & 1 \\ 1 & 0 & 0 & - & 0 & 0 \\ 0 & 1 & 0 & 1 & - & 0 \\ 1 & 1 & 1 & 1 & 0 & - \end{pmatrix}\]
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 0 | 0 | 1 | 0 | 1 |
| B | 0 | -- | 0 | 0 | 1 | 1 |
| C | 0 | 0 | -- | 0 | 0 | 1 |
| D | 1 | 0 | 0 | -- | 0 | 0 |
| E | 0 | 1 | 0 | 0 | -- | 0 |
| F | 1 | 1 | 1 | 0 | 0 | -- |


Sociological Meaning: - High \(R\) suggests trust-based, egalitarian social structures (friendships, partnerships). - Low \(R\) suggests hierarchical or competitive structures (respect, followers, citations).

You now understand: - Basic operations (Addition, Complement, Hadamard) combine or filter relationship types. - The Transpose flips directions; essential for directed networks. - The Dyad Census classifies all pairs into Mutual, Asymmetric, or Null categories using matrix operations. - Graph Reciprocity summarizes the balance between mutual and one-way ties.
Next session: Standard matrix multiplication, conformability, and dynamic applications (paths, walks, clustering).