Networks¶
Newman, M. E. J. (2018). Networks: An Introduction. Oxford University Press.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Network
- (1) A network is a set of entities together with a set of pairwise (or higher-order) connections among them, studied at the level of the connection pattern rather than the substantive identity of the entities: the essential commitment, as Newman (2010) frames it in his canonical textbook, is that structure — who is connected to whom, with what weights and directions — can carry enough explanatory power on its own to predict flows, reachability, influence, failure modes, and dynamics, even when the substantive content of the entities is set aside.
This sourceCanonical textbook of modern network science: develops the structural commitment that connection-pattern alone predicts flow, reachability, and resilience, and catalogues universal algorithms (shortest-path, max-flow/min-cut, community detection, centrality) that operate on any graph independent of substrate.
- (1) A network is a set of entities together with a set of pairwise (or higher-order) connections among them, studied at the level of the connection pattern rather than the substantive identity of the entities: the essential commitment, as Newman (2010) frames it in his canonical textbook, is that structure — who is connected to whom, with what weights and directions — can carry enough explanatory power on its own to predict flows, reachability, influence, failure modes, and dynamics, even when the substantive content of the entities is set aside.
- Threshold-Driven Order Emergence
This sourceCanonical textbook of modern network science: develops the structural commitment that connection-pattern alone predicts flow, reachability, and resilience, and catalogues universal algorithms (shortest-path, max-flow/min-cut, community detection, centrality) that operate on any graph independent of substrate.
- Universality in Critical Phenomena
- Structurally-faithful non-formal case — percolation threshold in disordered media:
This sourceCanonical textbook of modern network science: develops the structural commitment that connection-pattern alone predicts flow, reachability, and resilience, and catalogues universal algorithms (shortest-path, max-flow/min-cut, community detection, centrality) that operate on any graph independent of substrate.
- Structurally-faithful non-formal case — percolation threshold in disordered media:
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:bf164d3b36f7 · see in the full table