Hub Model
Updated 2026-09-11
INTRODUCTION
English translation pending.
CORE DEFINITION
The hub model identifies nodes of exceptionally high degree or betweenness that connect many peripheral nodes, producing a hub-and-spoke topology rather than a uniform mesh. The core proposition is that a small number of hubs determine the network's structure, efficiency, and vulnerability: they are the cheapest points at which to intervene and the most costly points to lose. The key qualification is that the same concentration that creates efficiency creates single points of failure, so hub advantages and hub risks cannot be separated.
SCAFFOLDING EFFECT
Reduce cognitive load
- Centrality scan: rank nodes by degree or betweenness to find the ones holding the network together. - Failure test: remove each hub hypothetically and see whether the network fragments. - Redundancy plan: protect or duplicate the hubs whose loss would split the system.
Anchor fast decisions
Preferential attachment concentrates links onto nodes that are already well connected, so the network develops a few dominant junctions and a long tail of peripheral members. Traffic and influence then flow through those junctions, which makes the network efficient per link and cheap to operate. The same concentration means removing one hub can disconnect a large fraction of the network at once.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Spoke%E2%80%93hub_distribution_paradigmverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS