Networks¶
Newman, M. (2018). Networks: An Introduction. Oxford University Press.
Cited by¶
4 citations across 4 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.
Supported in partVerified against the publisher's abstract
The publisher's abstract confirms formal, substrate-independent network analysis (graph theory, network data, processes on networks) but not the claim's predictive-sufficiency thesis.
“fundamentals of graph theory; computer algorithms, including spectral algorithms and community detection; mathematical models of networks such as random graph models and generative models; and models of processes taking place on networks.”
- (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:
Mechanisms¶
- Random Graph Null Ensemble
- So she rebuilds the ensemble from a configuration model that reproduces the observed degree sequence, and, for a third view, a stochastic block model that also preserves departmental community structure.
This sourceDefines the configuration model as a random graph with a specified degree sequence and the stochastic block model as a random-graph model parameterized by community blocks.
- So she rebuilds the ensemble from a configuration model that reproduces the observed degree sequence, and, for a third view, a stochastic block model that also preserves departmental community structure.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 4 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:5e0b98ecf90f · see in the full table