Directed Graph Metrics

The Basics of Social Network Analysis

Directed Graphs: Basic Elements

Asymmetric Ties & Directed Graphs

  • Some relationships have an inherent directionality (asymmetric ties):
    • e.g., “A helps B”, “A seeks advice from B”.
  • Unlike symmetric ties, mutuality or reciprocity is not guaranteed by definition.
  • Reciprocity is an empirical event in the world (mutuality must be measured rather than assumed).

Anti-Symmetric Ties & Hierarchies

  • Some directional relationships strictly forbid reciprocity (anti-symmetric ties):
    • If \(A \rightarrow B\) exists, then \(B \rightarrow A\) is structurally or logically impossible (\(AB \implies \neg BA\)).
    • e.g., “A is the father of B”, “A is the supervisor of B”.
  • Unlike asymmetric ties, reciprocity is not optional—it is strictly prohibited.
  • Concatenating these relations across multiple nodes naturally generates directed trees or strict hierarchies with no cycles.

Directed Graph Representation

  • Asymmetric networks are represented as a directed graph (or digraph):
    • Simple lines are replaced with arrows indicating directionality.
    • Every edge has a source node (sender) and a destination node (receiver).
    • Unlike undirected graphs, node order matters: edge \(AB\) is distinct from \(BA\).

Directed Graph: An Example

  • Let’s look at the digraph on the right:
    • Arrows indicate the direction of the relationship.
    • Some ties are reciprocated (e.g., \(A \leftrightarrow B\) and \(B \leftrightarrow D\)).
    • Others are strictly asymmetric (e.g., \(E \rightarrow C\), \(G \rightarrow F\)).

Neighborhoods in Directed Graphs (1)

  • Because links are directional, nodes have two neighborhoods.
  • In-Neighborhood (\(N^{in}(v)\)):
    • Set of source nodes pointing to \(v\).
    • Example: \(N^{in}(D) = \{B, E, G\}\) (highlighted in gold, pointing to focal node D in tomato).

Neighborhoods in Directed Graphs (2)

  • Out-Neighborhood (\(N^{out}(v)\)):
    • Set of destination nodes that \(v\) points to.
    • Example: \(N^{out}(B) = \{A, C, D\}\) (highlighted in gold, pointing from focal node B in tomato).

Directed Neighborhoods: Reciprocity

  • A node appears in both neighborhoods only if there is a reciprocal (mutual) tie.
  • Example for Node B (in tomato):
    • In-Neighborhood: \(N^{in}(B) = \{A, D\}\)
    • Out-Neighborhood: \(N^{out}(B) = \{A, C, D\}\)

Directed Neighborhoods: Reciprocity Overlap

  • Since there are reciprocal ties \(A \leftrightarrow B\) and \(B \leftrightarrow D\), nodes A and D (in gold) belong to both sets.
  • Therefore, the overlap is the intersection of these two neighborhoods: \[N^{in}(B) \cap N^{out}(B) = \{A, D\}\]

Directed Neighborhood Intersection

  • In directed graphs, neighborhood intersections can be defined for incoming or outgoing ties:
  • In-Neighborhood Intersection: Common source nodes pointing to both \(u\) and \(v\):
    • \(N^{in}(D) \cap N^{in}(A) = \{B\}\) (focal nodes \(D\) and \(A\) in tomato; common source \(B\) in gold)
  • Out-Neighborhood Intersection: Common destination nodes that both \(u\) and \(v\) point to:
    • \(N^{out}(B) \cap N^{out}(E) = \{C, D\}\) (shown on the next slide)

Directed Neighborhood Intersection: Example

  • Let’s visualize the out-neighborhood intersection of nodes B and E (in tomato):
    • \(N^{out}(B) = \{A, C, D\}\)
    • \(N^{out}(E) = \{C, D\}\)
  • They share two common destination nodes:
    • \(N^{out}(B) \cap N^{out}(E) = \{C, D\}\) (in gold)

Directed Neighborhood Union

  • Similarly, directed neighborhood unions combine the sets of neighbors:
  • In-Neighborhood Union: Nodes pointing to either \(u\) or \(v\):
    • \(N^{in}(D) \cup N^{in}(A) = \{B, E, F, G\}\) (focal nodes \(D\) and \(A\) in tomato; union members in gold)
  • Out-Neighborhood Union: Nodes that either \(u\) or \(v\) points to:
    • \(N^{out}(B) \cup N^{out}(E) = \{A, C, D\}\) (shown on the next slide)

Directed Neighborhood Union: Example

  • Let’s visualize the out-neighborhood union of nodes B and E (in tomato):
    • \(N^{out}(B) = \{A, C, D\}\)
    • \(N^{out}(E) = \{C, D\}\)
  • Combining all unique destination nodes gives:
    • \(N^{out}(B) \cup N^{out}(E) = \{A, C, D\}\) (in gold)

Node Degree

Node Degree in Directed Graphs: Indegree

  • Directed graphs have two distinct degrees for each node.
  • Indegree (\(k^{in}_i\)):
    • Number of edges pointing to node \(i\) (cardinality of \(N^{in}(i)\)).
    • Sociological meaning: Popularity, Prestige, or Status.

Indegree: An Example

  • Let’s find the indegree for Node D (in tomato) on the right:
    • Source nodes pointing to D: \(N^{in}(D) = \{B, E, G\}\) (in gold)
    • Indegree: \(k^{in}_D = |N^{in}(D)| = 3\)
  • Node D has 3 incoming arrows, representing a node with relatively high popularity or status.

Node Degree in Directed Graphs: Outdegree

  • Outdegree (\(k^{out}_i\)):
    • Number of edges pointing from node \(i\) (cardinality of \(N^{out}(i)\)).
    • Sociological meaning: Sociability or Activity.

Outdegree: An Example

  • Let’s find the outdegree for Node B (in tomato) on the right:
    • Target nodes that B points to: \(N^{out}(B) = \{A, C, D\}\) (in gold)
    • Outdegree: \(k^{out}_B = |N^{out}(B)| = 3\)
  • Node B has 3 outgoing arrows, representing a node with relatively high sociability or activity.

Types of Nodes in Directed Graphs

  • In a directed graph, we can distinguish three types of (non-isolate) nodes based on incoming and outgoing ties:
    1. Receivers: Nodes that receive ties but do not send them (\(k_{in} > 0\) and \(k_{out} = 0\)).
    2. Transmitters: Nodes that send ties but do not receive them (\(k_{in} = 0\) and \(k_{out} > 0\)).
    3. Carriers: Nodes that both receive and send ties (\(k_{in} > 0\) and \(k_{out} > 0\)).

Node Types: An Example

  • Looking at the directed graph on the right:
    • Receiver: Node C (only receives ties).
    • Transmitters: Nodes E and G (only send ties).
    • Carriers: Nodes A, B, D, F (both receive and send ties).

Directed Degree Sets & Sequences

  • Directed graphs have two distinct degree sets and two distinct degree sequences—one of each for in-degree and out-degree.
  • For our 7-node directed graph (shown on the right):
    • In-Degree Set: \(\{2, 2, 2, 3, 0, 2, 0\}\)
    • In-Degree Sequence: \((3, 2, 2, 2, 2, 0, 0)\)
    • Out-Degree Set: \(\{2, 3, 0, 1, 2, 1, 2\}\)
    • Out-Degree Sequence: \((3, 2, 2, 2, 1, 1, 0)\)

Directed Degree Range & Sum

  • Like undirected graphs, we can define the maximum, minimum, and range of degrees.
  • In directed graphs, these are defined separately for in-degree and out-degree:
    • In-Degree Range: \(k^{in}_{max} - k^{in}_{min}\)
    • Out-Degree Range: \(k^{out}_{max} - k^{out}_{min}\)
  • Degree Sum Rule:
    • The sum of in-degrees and the sum of out-degrees are both equal to the graph size \(m\) (total number of directed edges/arcs): \(\sum_{i=1}^{n} k^{in}_i = \sum_{i=1}^{n} k^{out}_i = m\)

Directed Range & Sum: Example (In-Degree)

  • For our 7-node directed graph (shown again on the right, \(m = 11\)):
    • In-Degrees: \(k^{in} = (2, 2, 2, 3, 0, 2, 0)\)
      • \(k^{in}_{max} = 3\) (Node D), \(k^{in}_{min} = 0\) (Nodes E and G)
      • Range \(k^{in}_r = 3 - 0 = 3\)
      • Sum \(\sum k^{in}_i = 2+2+2+3+0+2+0 = 11\)

Directed Range & Sum: Example (Out-Degree)

  • For our 7-node directed graph (shown again on the right, \(m = 11\)):
    • Out-Degrees: \(k^{out} = (2, 3, 0, 1, 2, 1, 2)\)
      • \(k^{out}_{max} = 3\) (Node B), \(k^{out}_{min} = 0\) (Node C)
      • Range \(k^{out}_r = 3 - 0 = 3\)
      • Sum \(\sum k^{out}_i = 2+3+0+1+2+1+2 = 11\)

Basic Graph Metrics

Graph Order and Size

  • Graph Order (\(n\)):
    • The number of nodes in the graph (\(n = |V|\)).
    • Cardinality of the vertex set.
  • Graph Size (\(m\)):
    • The number of edges in the graph (\(m = |E|\)).
    • Cardinality of the edge set.

Order and Size: Directed Example

  • Let’s look at the directed graph on the right:
    • Node Set (\(V\)): \(\{A, B, C, D, E, F, G\}\)
    • Edge Set (\(E\)): \(\{AB, AF, BA, BD,\)
      \(BC, DB, EC, ED,\)
      \(FA, GF, GD\}\)
    • Graph Order (\(n = |V|\)): 7 nodes
    • Graph Size (\(m = |E|\)): 11 edges
  • In directed graphs, edges are ordered pairs:
    • The order in which the nodes are listed matters: \(AB\) (from \(A\) to \(B\)) is a different edge than \(BA\) (from \(B\) to \(A\)).
    • That’s why both \(AB\) and \(BA\) can appear in the edge set above.

Graph Maximum Size

  • The maximum size of a simple graph of order \(n\) is the number of edges in a complete graph (where every node is connected to every other node).
  • Undirected: \(Max(E) = \frac{n(n - 1)}{2}\)
  • Directed: \(Max(E) = n(n - 1)\)

Maximum Size: Directed Example

  • Let’s look at the directed graph on the right:
    • Order (\(n\)): 7 nodes
  • Formula: \[Max(E) = n(n - 1)\]

Maximum Size: Directed Calculation

  • Order (\(n\)): 7 nodes (shown on the right)
  • Maximum possible size calculation: \[Max(E) = 7 \times (7 - 1) = 7 \times 6 = 42\text{ edges}\]
  • Interpretation:
    • A complete directed graph with 7 nodes would have exactly 42 directed arcs.

Graph Density: Formulas (Directed)

  • Density (\(d\)) is the ratio of the observed number of edges (\(m\)) to the maximum possible number of edges.

  • It is a value between 0 (completely empty) and 1 (complete graph).

  • Directed Graph: \[d = \frac{m}{n(n-1)}\]

Graph Density: Interpretation

  • Connection Probability:
    • Density is the probability that a randomly chosen ordered pair of distinct nodes is connected (i.e., that a tie points from the first node to the second).
  • Network Resilience:
    • Denser networks are generally more resilient and less vulnerable to breakdowns when key nodes are removed.

Density: Directed Example

  • Let’s look at the directed graph on the right:
    • Order (\(n\)): 7 nodes
    • Size (\(m\)): 11 directed edges
    • Maximum possible edges: \[Max(E) = 7 \times 6 = 42\]

Density: Directed Calculation

  • Observed directed edges (\(m\)): 11 (shown on the right)
  • Maximum possible edges: 42
  • Density Formula: \[d = \frac{m}{Max(E)} = \frac{11}{42} \approx 0.262\]
  • Interpretation:
    • Exactly 26.2% of all possible directed ties are present in this network.

Comparing Density: Undirected vs. Directed

  • Maximum Possible Edges:
    • Undirected: \(Max(E)_{undir} = \frac{n(n - 1)}{2}\)
    • Directed: \(Max(E)_{dir} = n(n - 1)\)
  • Density Scaling:
    • Because a directed graph can hold exactly twice as many edges as an undirected graph of the same order: \(d_{dir} = \frac{1}{2} d_{undir} \quad \text{for the same } m \text{ and } n\)
    • Directed density is always more “conservative”—it requires twice as many edges as an undirected graph to reach the same level of density!

Density Scaling: A Direct Comparison

Table 1: Density Comparison Matrix
Metric Undirected Graph Directed Graph
Formula \(d = \frac{2m}{n(n-1)}\) \(d = \frac{m}{n(n-1)}\)
Max Edges (\(n = 7\)) \(21\) edges \(42\) edges
If \(m = 11\) edges \(d \approx 0.524 \quad (52.4\%)\) \(d \approx 0.262 \quad (26.2\%)\)
If \(m = 21\) edges \(d = 1.000 \quad (100.0\%)\) \(d = 0.500 \quad (50.0\%)\)

Directed Average Degree

  • Average In-Degree (\(\bar{k}^{in}\)) and Average Out-Degree (\(\bar{k}^{out}\)): \(\bar{k}^{in} = \frac{1}{n} \sum_{i=1}^{n} k^{in}_i \quad \text{and} \quad \bar{k}^{out} = \frac{1}{n} \sum_{i=1}^{n} k^{out}_i\)
  • The Equivalence Theorem:
    • In every directed graph, the average in-degree is exactly equal to the average out-degree: \(\bar{k}^{in} = \bar{k}^{out} = \frac{m}{n}\)
    • Why? Each directed edge \(u \rightarrow v\) adds exactly 1 to the out-degree of \(u\) and exactly 1 to the in-degree of \(v\).

Equivalence of Means: Example

  • In our 7-node directed graph:
    • Order (\(n\)): 7 nodes
    • Size (\(m\)): 11 directed edges
  • Mean In-Degree: \(\bar{k}^{in} = \frac{2+2+2+3+0+2+0}{7} = \frac{11}{7} \approx 1.57\)
  • Mean Out-Degree: \(\bar{k}^{out} = \frac{2+3+0+1+2+1+2}{7} = \frac{11}{7} \approx 1.57\)
  • They are equal! (\(\bar{k}^{in} = \bar{k}^{out} = 1.57 = m/n\))

Interpreting the Density-Degree Connection

  • Density is Average Degree Scaled by Group Size:
    • The density of a directed graph is simply its average degree divided by the maximum possible connections of any single node (\(n-1\)).
  • For Example:
    • In a group of \(n = 10\) people, each person can have at most \(n-1 = 9\) connections.
    • If the average number of friends (\(\bar{k}\)) is \(4.5\), then the density of friendship is: \[d = \frac{4.5}{9} = 0.50 \quad (50\%)\]
  • Directed Case:
    • Since \(d^d = \frac{m}{n(n-1)}\) and \(\bar{k}\) is \(\frac{m}{n}\), we get the same identity: \(d^d = \frac{\bar{k}}{n-1}\)

Directed Degree Variance

  • While the means are always equal, the variances of in-degree and out-degree can be completely different!
  • In-Degree Variance (\(\sigma^2_{in}\)): \(\sigma^2_{in} = \frac{1}{n} \sum_{i=1}^{n} (k^{in}_i - \bar{k}^{in})^2\)
    • Sociological meaning: Measures inequality in prestige/popularity (do a few nodes receive all ties?).
  • Out-Degree Variance (\(\sigma^2_{out}\)): \(\sigma^2_{out} = \frac{1}{n} \sum_{i=1}^{n} (k^{out}_i - \bar{k}^{out})^2\)
    • Sociological meaning: Measures inequality in sociability/activity (do some nodes send way more ties than others?).

Directed Degree Variance: Example (In-Degree)

  • In our 7-node directed graph:
    • Mean degree (\(\bar{k}\)) is \(\approx 1.57\)
  • In-Degree Variance (\(\sigma^2_{in}\)):
    • Values:
      • \(k^{in} = (2, 2, 2, 3, 0, 2, 0)\)
    • Calculation:
      • \(\frac{4 \times (2-1.57)^2 + 1 \times (3-1.57)^2 + 2 \times (0-1.57)^2}{7} =\)
      • \(\frac{4 \times 0.18 + 2.04 + 2 \times 2.47}{7} \approx 1.102\)

Directed Degree Variance: Example (Out-Degree)

  • In our 7-node directed graph:
    • Mean degree (\(\bar{k}\)) is \(\approx 1.57\)
  • Out-Degree Variance (\(\sigma^2_{out}\)):
    • Values:
      • \(k^{out} = (2, 3, 0, 1, 2, 1, 2)\)
    • Calculation:
      • \(\frac{3(2-1.57)^2 + (3-1.57)^2 + (0-1.57)^2 + 2(1-1.57)^2}{7} \approx 0.816\)
  • In-degree is more heterogeneous than out-degree in this network!

Special Classes of Directed Graphs

Symmetric Directed Graphs

  • Symmetric Directed Graph:
    • A digraph where for every directed arc \(u \rightarrow v\), the reverse arc \(v \rightarrow u\) is also present.
    • Formally: \(AB \iff BA\).
  • Key Properties:
    • It is a directed representation of an undirected (symmetric) graph.
    • Every connected dyad is reciprocal (Mutual).

Functional Graphs

  • Functional Graph:
    • A directed graph where every node has an outdegree of exactly 1: \[k^{out}_v = 1 \quad \text{for all } v \in V\]
  • Key Properties:
    • Represents a single-valued function \(f: V \rightarrow V\), mapping each node to exactly one target.
    • e.g., “Who is your best friend?” or “Who is your immediate boss?”

Oriented Graphs

  • Oriented Graph:
    • A directed graph obtained by choosing a single direction for each edge in an undirected graph.
  • Key Properties:
    • No reciprocal (mutual) arcs can exist: if \(u \rightarrow v\) is present, then \(v \rightarrow u\) is forbidden.
    • Represents purely non-reciprocal systems of interaction or asymmetric flows.

Directed Tree Graphs

  • Directed Tree Graph:
    • A directed, acyclic graph where a single root node has an indegree of 0, and all other nodes have an indegree of exactly 1: \[k^{in}_{root} = 0 \quad \text{and} \quad k^{in}_v = 1 \quad \text{for all other } v\]
  • Key Properties:
    • Naturally models strict authority hierarchies or family trees.
    • Every node has exactly one parent or supervisor, with zero loops or overlapping chains of command.