{"slug":"oip-convergence-edge-9","title":"Convergence Edge 9: Branching ↔ Networks","body":"**C16** (Branching) recurs-with **C11** (Networks)\n\n**Shared pattern:** Hierarchical connectivity; few large channels, many small ones; optimal transport through tree-like structures\n\n**Domain distance:** Physiology/Geology → Sociology/Technology (large)\n\n**Derivation independence:** HIGH. Murray (physiology, 1926) derived the law from blood flow. Horton (geology, 1945) found stream ordering. Barabasi (physics, 1999) found hub-and-spoke in scale-free networks. The tree structure of branching transport and the hub structure of scale-free networks are geometric duals: both minimize average path length given connectivity constraints.\n\n**Convergence strength (1–10):** 7\n\n**Note:** The convergence is in the optimization structure: both are solutions to the problem of connecting many points to one source with minimum cost. One is continuous (branching), one is discrete (network).\n\n---\n\n## Corpus map\n- C16 (Branching): [C16 in the Encyclopedia](/a/convergence-encyclopedia-c16) · [C16 in the Catalogue](/a/oip-node-c16-branching-optimal-transport)\n- C11 (Networks): [C11 in the Encyclopedia](/a/convergence-encyclopedia-c11) · [C11 in the Catalogue](/a/oip-node-c11-networks-small-world-scale-free)\n- Convergence edges: [1](/a/oip-convergence-edge-11) · [2](/a/oip-convergence-edge-22) · [3](/a/oip-convergence-edge-33) · [4](/a/oip-convergence-edge-44) · [5](/a/oip-convergence-edge-55) · [6](/a/oip-convergence-edge-66) · [7](/a/oip-convergence-edge-77) · [8](/a/oip-convergence-edge-88) · [9](/a/oip-convergence-edge-99) · [10](/a/oip-convergence-edge-1010)\n- Catalogue hub: [Convergence Catalogue — Public Article](/a/oip-convergence-public-article) · [The Schema](/a/oip-convergence-schema)","register":"oip_protocol","tags":["OIP","catalogue","convergence","edge"],"category":null,"style":{},"claims":[{"id":"c1","text":"C16 (Branching) recurs-with C11 (Networks)","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Core relation asserted for the convergence edge"},{"id":"c2","text":"Shared pattern is hierarchical connectivity with few large channels, many small ones, and optimal transport through tree-like structures","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Defines the common structural property"},{"id":"c3","text":"Domain distance is Physiology/Geology to Sociology/Technology and is large","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Quantifies cross-domain separation"},{"id":"c4","text":"Derivation independence is HIGH","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Assesses independence of the derivations"},{"id":"c5","text":"The tree structure of branching transport and the hub structure of scale-free networks are geometric duals that both minimize average path length given connectivity constraints","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"States the mathematical duality"},{"id":"c6","text":"Convergence strength is 7","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Assigns the numerical convergence rating"},{"id":"c7","text":"The convergence is in the optimization structure where both are solutions to connecting many points to one source with minimum cost, one continuous (branching) and one discrete (network)","section":"","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Specifies the nature of the convergence"}],"sources":[],"prov":{"model":"Fable 5 (Claude Code)","action":"write"}}