Individual skill

s4h-network-centrality

Identifies which nodes in a network have the most influence, reach, or control. Use when asked 'who are the key players', 'who should we target', 'where is the bottleneck', 'who connects everyone', 'who would we lose most if they left', or when mapping influence in an organisation, market, or social network.

skills/s4h-network-centrality/SKILL.md

Read pinned source

Source commit a30df8b67698ccb03ef5e35d68c2eddc5321ad3f

What was checked

Matches the observed repository HEAD
Yes
Scanner rules are current
Yes
Repository scan complete
No
Skill scan complete
No
Observed behavior
Instructions only
Last checked
Nov 11, 2026

These are observations at the recorded commit, not a guarantee of safety. Review the source before running it.

Install this skill

Choose an agent in your Stack or copy a command below. Commands fetch the pinned commit and copy only this skill directory. Existing destinations are refused. Copying a command does not install anything.

An install command is unavailable: current rules, complete repository and skill scans, an eligible behavior level and a permitted license are required.

Repository context

Repository stars (not skill ratings)
241
Repository last updated
Jul 15, 2026
License
MIT

Observed agent integration: No specific integration evidence. Standard SKILL.md installation does not imply verified compatibility.

Files and excerpt

File metadata and permitted, redacted excerpts come from the recorded scan. Source links are pinned to that commit.

Browse files
Read excerpt

# Network: Centrality

In almost every network — social, organizational, digital, biological — a small number of nodes exert disproportionate influence. They are not necessarily the most visible or the most senior. They are the most structurally positioned. Albert-László Barabási's research on scale-free networks established that real-world networks follow power-law degree distributions: a few hubs have vastly more connections than average, while most nodes have very few. These hubs emerge through preferential attachment — new nodes connect to already-well-connected nodes — which means structural inequality in networks is self-reinforcing.

Centrality analysis unpacks what "important" means in a specific network. There are four distinct types of centrality, and they identify different kinds of importance. A node can be a hub (high degree), a broker (high betweenness), an efficient spreader (high closeness), or influential because it is connected to other influential nodes (high eigenvector). These often coincide — but when they diverge, the divergence is analytically rich.

The key implication: targeting or protecting the most central nodes has outsized effect. Removing a high-betweenness broker can fragment a network; reaching a high-eigenvector hub can cascade influence throughout it.

---

## Your Process

**Step 1: Define the Network**
Name the nodes (what entities?) and the edges (what relationship?). Be precise about direction — is the relationship directional (A influences B but not vice versa) or undirected (mutual connection)? Name the time horizon and state what question you are trying to answer with centrality analysis.
Back to top