Scale-Free Network
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
A special type of complex network where the degree distribution of nodes follows a power law. Most nodes have only a few connections, but a very small number of nodes (hubs) have an extremely large number of connections. - Characteristics: It is highly robust against random attacks (the network does not collapse when a few nodes are randomly removed), but extremely vulnerable to deliberate attacks on hub nodes (removing the big hubs causes the network to collapse). -
SCAFFOLDING EFFECT
Reduce cognitive load
Precise targeting of system vulnerabilities. - The Internet, aviation networks, and social networks are all scale-free. This means: to protect a system, one must protect those 'super nodes' at all costs; to destroy a system, ...
Anchor fast decisions
Proposed by Barabási and Albert: most nodes have few connections, a few hub nodes have many connections, and the degree distribution follows a power law, rather than the Poisson distribution of random networks.
MINIMUM ACTION
In progress 0/3Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Scale-free_networkverified
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