How do in-degree and out-degree differ in directed networks?
In directed networks, degree centrality is split into two distinct metrics based on edge direction. In-degree counts the number of edges flowing into a node, while out-degree counts the number of edges flowing out of the node.
Conditions
- Applies to directed networks where edges have a specific direction.
Reasoning, step by step
- Identify the arrows on the edges connected to the node.
- Count the number of arrows pointing towards the node to find its in-degree.
- Count the number of arrows pointing away from the node to find its out-degree.
Example
In the directed network example, the orange node has an in-degree of 1 and an out-degree of 2. The green node has an in-degree of 2 and an out-degree of 2.
Common misconceptions
- Treating directed edges as undirected when calculating degree, which ignores the directional constraints of the network.
Watch the explanation
Explore next
Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.