foundations-network-science
Installation
SKILL.md
Network Science Foundations
When to Apply
Apply network-science when:
- The data IS a graph — citations, dependencies, follower graphs, supply chains, knowledge graphs
- The system is a graph even if the data is not — LLM multi-agent communication topology, agent memory graphs, tool-call graphs (see Agent Topology as a Graph Problem)
- Spread/contagion question — viral coefficient, R₀, percolation threshold
- Centrality question — "which nodes are critical?" (PageRank, betweenness, eigenvector)
- Community detection — clustering nodes by structural similarity (Louvain, Leiden)
- Blast-radius / dependency-impact analysis on services or modules
Skip and use simpler alternatives when:
- Data is tabular and relationships aren't structural — standard analytics suffices
- The decision is already answerable by direct inspection and a graph model adds no stable ranking or counterfactual value
- Question is about strategic interaction at the node level — use foundations-game-theory
- Question is about queue or flow through a single bottleneck — use foundations-queueing-theory or theory-of-constraints
- Edges are weak proxies (e.g. "users who viewed both products") — centrality is unreliable; validate edge semantics first
- A "network effects" claim concerns how product value changes with other users' participation, not referral reproduction R; measure the relevant value effect separately from viral growth (Easley & Kleinberg, ch. 17)