Dependency Network Graph¶
Mapping artifact — instantiates Regime-Shift Impact Boundary Characterization
Represents the system as nodes and typed, weighted edges rooted at the initial impact locus, so consequences can be traced outward along explicit coupling paths instead of being assumed to stop at convenient borders.
A Dependency Network Graph renders the system as nodes and directed, typed edges — a formal topology of who depends on whom, by what pathway — rooted at the subsystem where the regime shift first bites. Its defining move is making the wiring explicit: instead of intuiting how far a consequence "feels like" it should reach, you draw the actual physical, financial, informational, and contractual links, then trace reachability outward from the locus along them. It is a static structural artifact. It answers what can reach what, and along which path — not how much or how fast (that is a simulation running current through this circuit), and not how bad the arrival is (that is a heat map). Its whole value is turning far-field exposure from a hunch into a traceable path or, just as usefully, into a visible absence of path.
Example¶
A government imposes a new export-control regime barring a category of chip-making tools to one region — a discrete change in the rules governing a supply network. The first instinct is that the impact is "contained" to the sanctioned fabs. A Dependency Network Graph tests that. The initial locus is the affected tool vendor. Nodes are firms, fabs, materials suppliers, and licensing bodies; directed edges carry a type (supplies, licenses, sole-sources, co-owns IP) and a weight for substitutability.
Tracing outward two hops, the graph exposes a node no one flagged: a specialty process-gas supplier that feeds not only the sanctioned fab but three "unrelated" fabs on other continents, through a link that appears on no org chart. Because that supplier is an articulation point — remove it and several downstream device-makers disconnect from their inputs — the graph reveals that a seemingly regional control ripples into automotive electronics via a path the export authority never modeled. The output is not a severity estimate; it is a map that says this reaches there, through here.
How it works¶
- Root at the locus. Fix the initial-impact node and grow the graph outward from it, so traversal has a defined origin rather than a diffuse "everything is connected."
- Type and weight the edges. Distinguish dependency kinds (physical, financial, informational, legal) and weight by coupling strength or substitutability, so a fragile sole-source link is not drawn the same as a swappable commodity one.
- Compute reachability and choke points. Use paths, hop-distance, and articulation points / single-points-of-failure to find where consequences can travel and where a single node gates a whole region.
- Read the gaps as boundaries. Where no edge exists — or only weak, redundant ones do — the graph marks a candidate structural edge of the impact.
It stops at structure. It does not step time forward or estimate magnitudes; it hands its topology to the mechanisms that do.
Tuning parameters¶
- Node granularity — firms versus facilities versus individual assets. Finer nodes expose real choke points but explode the graph and its upkeep.
- Edge typing / multiplexity — one blended link versus separate physical / financial / informational layers. Multiplex layers reveal cross-domain paths but demand far more data.
- Weighting scheme — binary presence versus quantified coupling strength. Weights let you rank paths, but a spurious weight invites reading magnitude off structure it can't support.
- Traversal depth — how many hops from the locus you map. Deeper reach catches far-field links but drags in noise and false connections.
- Directedness — treating dependencies as directed (A needs B) versus symmetric. Direction matters for propagation but doubles the modeling care.
When it helps, and when it misleads¶
Its strength is making far-field paths explicit and checkable: hidden two-hop couplings, sole-source articulation points, and the difference between a border that stops propagation and one that merely looks tidy. A shared node that couples two supposedly independent networks is exactly what single-network intuition misses.[1]
Its central failure mode is that a graph is only as complete as its edge list — the coupling that gets you is the one you never drew, and unknown or unrecorded edges leave phantom boundaries that look solid. A related trap is that coupling strength is not static: a weak edge can become load-bearing precisely when the primary path fails, so a graph built under normal conditions can misjudge the stressed system. The classic misuse is reading graph distance as impact magnitude — treating "two hops away" as "small effect," when a distant node can be devastated and a neighbor buffered. The discipline that guards against this is to red-team the topology for missing edges before trusting it, and to hand the graph to a propagation model to test dynamics rather than inferring severity from the picture.
How it implements the components¶
A structural map fills the pathway side of the archetype, and only that side:
coupling_and_dependency_map— the graph is this map made formal: every claimed transmission route is an explicit typed, weighted edge, so coupling is enumerated rather than asserted.initial_impact_locus— the locus is the graph's root node, the fixed origin from which reachability and choke-point analysis proceed.
It does not compute how far or how fast impact actually travels (nested_impact_zone_model, buffer_and_dampening_boundary_assessment) — that dynamic reckoning is Propagation Simulation, its nearest twin: the graph draws the circuit, the simulation runs current through it. Nor does it grade a zone's severity (severity_time_reversibility_matrix), which is Impact Heat Map.
Related¶
- Instantiates: Regime-Shift Impact Boundary Characterization — the graph supplies the coupling topology the whole boundary analysis traces over.
- Consumes: Scenario Fan-Out Workshop — the workshop's regime definition scopes which dependencies are relevant to draw.
- Sibling mechanisms: Propagation Simulation · Impact Heat Map · Exposure Overlay Map · Scenario Fan-Out Workshop · Boundary Update Log · Sentinel Dashboard · Cross-Impact Matrix
Editorial Notes¶
Form Classification¶
Form family: Representation, Specification & Plan
Rationale: Dependency Network Graph operates as a non-executable information artifact that externalizes static or prospective structure because it represents the system as nodes and typed, weighted edges rooted at the initial impact locus, so consequences can be traced outward along explicit coupling paths instead of being assumed to stop at convenient borders.
Independent corroboration: The frozen evidence defines Dependency Network Graph as 'Represents the system as nodes and typed, weighted edges rooted at the initial impact locus, so consequences can be traced outward along explicit coupling paths instead of being assumed to stop at convenient borders', so its operative form is Representation, Specification & Plan.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Systems Thinking & Cybernetics
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Multi-domain
Rationale: Systems analysis is primary because the artifact maps heterogeneous physical, informational, financial, and institutional dependencies as a directed structure for tracing cross-system reach from an initial locus. Statistical physics materially formalized how such interdependent-network couplings generate cascading fragility.
Related originating lineages:
- Physics — Statistical physics formalized cascading failure and fragility across explicitly coupled interdependent networks.
Review resolution: Systems analysis is primary because the artifact maps heterogeneous physical, informational, financial, and institutional dependencies as a directed structure for tracing cross-system reach from an initial locus. Statistical physics materially formalized how such interdependent-network couplings generate cascading fragility.
Attribution caveat: The static cross-domain map is systems-analytic; its cascade interpretation inherits a distinct statistical-physics network lineage.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Researched adjudication after independent review; high confidence.
Sources consulted:
- CISA Infrastructure Dependency Primer
- Buldyrev et al.: Catastrophic cascade of failures in interdependent networks
References¶
[1] Buldyrev, Parshani, Paul, Stanley & Havlin, Catastrophic cascade of failures in interdependent networks (Nature, 2010), showed that coupling between two networks makes the combined system far more fragile than either alone — failures ricochet across the coupling in ways single-network analysis cannot see. It is the formal warning behind this mechanism's insistence on drawing cross-domain edges. registry ↩