https://doi.org/10.1093/acprof:oso/9780199206650.001.0001¶
Newman, M. (2010). https://doi.org/10.1093/acprof:oso/9780199206650.001.0001: An Introduction. Networks: An Introduction.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Assortative Mixing
- Listed in the references but not attached to a specific claim.
- Connectedness
- The identical structural vocabulary serves an epidemiologist building a contact-tracing graph — where removing the edges (quarantine) that separate an infected component from a healthy one is the containment cut — and an organizational analyst auditing whether two teams form one collaborative component or two silos joined by no path, where adding a single liaison bridge merges them.
This sourceComponents, percolation, and the use of edge removal (e.g. quarantine in contact networks) to break a network into disconnected pieces.
- The identical structural vocabulary serves an epidemiologist building a contact-tracing graph — where removing the edges (quarantine) that separate an infected component from a healthy one is the containment cut — and an organizational analyst auditing whether two teams form one collaborative component or two silos joined by no path, where adding a single liaison bridge merges them.
Domain-specific¶
- Friendship Paradox
- If a network's degree distribution has mean ⟨k⟩ and variance Var(k), then the expected degree of a node reached by following a randomly chosen edge is ⟨k⟩ + Var(k)/⟨k⟩
This sourceNewman's networks textbook, which develops the degree distribution's mean and variance and the excess-degree distribution of a node reached by following a randomly chosen edge.
Supported in partVerified against the publisher's abstract
“This book brings together for the first time the most important breakthroughs in each of these fields”
- If a network's degree distribution has mean ⟨k⟩ and variance Var(k), then the expected degree of a node reached by following a randomly chosen edge is ⟨k⟩ + Var(k)/⟨k⟩
- Random graph
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:c4cadc744f56 · see in the full table