JKISeason4-27

Traveling in Europe

JKISeason4-27

Closeness & Centrality

Degrees

Shortest Path

• Degree

  • Number of edges attached to a node.

  • “How many connections does this node have?”

  • In directed graphs: in-degree (incoming), out-degree (outgoing).

• Paths & shortest paths

  • A path = sequence of nodes connected by edges.

  • Shortest path = path with minimum total weight (distance / cost / hops).

• Centrality

  • Degree centrality – how many connections a node has.

  • Betweenness centrality – how often a node lies on shortest paths between others (good for identifying “bridges” or bottlenecks).

  • Closeness centrality – how close a node is, on average, to all others (good for “central hubs”).

• Components / clusters

  • Connected components – groups where every node can reach every other node (within the group).

  • Communities / clusters – sub-networks where nodes are more densely connected internally (e.g., natural regions, supplier clusters).

• Edge types / multiplexity (slightly advanced but useful)

  • Same pair of nodes can have different relationships:

    • physical flow, information flow, financial flow, etc.

DataPrep

Network Analyze