| phenomenon | structure and function of complex networks— “This paper reviews recent (and some not-so-recent) work on the structure and function of networked systems such as these.” |
| claim-type | existence— “The most important observation to come out of studies such as these is that networks are generally very far from random.” |
| method — evidence | — “Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.” |
| transfer | from mathematics (graph theory): building the study of complex networks on the foundation of mathematical graph theory, with statistical-physics methods— “The study of networks, in the form of mathematical graph theory, is one of the fundamental pillars of discrete mathematics.” | transfers[0] |
| mechanism | generative network models - random graphs and growth with preferential attachment - reproduce the observed structure of real networks (skewed degree distributions, small-world, clustering)— “models of network growth and preferential attachment” | mechanisms[0] |
| qualifies | Barabási and Albert, preferential attachment— “The work of Price himself, however, is largely unknown in the scientific community, and cumulative advantage did not achieve currency as a model of network growth until its rediscovery some decades later by Barab´asi and Albert [32], who gave it the new name of preferential attachment.” | claim_relations[0] |
| contradicts | the preferential-attachment model as a model of the Web— “This correlation between degree and age has been used by Adamic and Huberman [4] to argue against the model as a model of the World Wide Web—they show using actual Web data that there is no such correlation in the real Web.” | claim_relations[1] |
| reinterprets | Milgram's small-world experiment— “However, there is another conclusion that can be drawn from this experiment which Milgram apparently failed to notice; it was pointed out in 2000 by Kleinberg” | claim_relations[2] |
| sense | scale-free network - the term in general use, which the review says applies only to the degree distribution and not to the network's other properties— “They are sometimes referred to as scale-free networks [32], although it is only their degree distributions that are scale-free;13 one can and usually does have scales present in other network properties.” | senses[0] |
| sense | network - the stipulated vocabulary of the review: a set of items called vertices, with connections between them called edges— “A network is a set of items, which we will call vertices or sometimes nodes, with connections between them, called edges” | senses[1] |
| sense | `connectivity` - A NAME THIS REVIEW REFUSES, AND IT SAYS WHY: `In a few recent articles, the degree is referred to as the “connectivity” of a vertex, but we avoid this usage because the word connectivity already has another meaning in graph theory.` A refusal grounded in COLLISION WITH A NEIGHBOURING FIELD rather than in the term being wrong - the new usage is intelligible and is declined because the word is already taken.— “In a few recent articles, the degree is referred to as the “connectivity” of a vertex, but we avoid this usage because the word connectivity already has another meaning in graph theory.” | senses[2] |
| sense | `network density` - THE SAME WORDS NAMING A DIFFERENT QUANTITY BY FIELD: in sociology it names the LOCAL clustering coefficient Ci of a single vertex, which is what this passage records. Elsewhere `density` names the global edge count over possible edges. A reader who imports the sociological sense into the physics literature is reading a per-vertex quantity as a whole-graph one.— “The local clustering Ci above has been used quite widely in its own right in the sociological literature, where it is referred to as the “network density” [363].” | senses[3] |
| sense | `assortative mixing` / `homophily` / `assortative matching` - ONE PHENOMENON, THREE NAMES, AND THE REVIEW ATTRIBUTES EACH TO ITS FIELD: `called assortative mixing or homophily` in social networks and epidemiology, while `the term ASSORTATIVE MATCHING is also seen in THE ECOLOGY LITERATURE, particularly in reference to mate choice among animals`. The ecological name carries a narrower referent - mate choice - inside the same concept.— “In social networks this kind of selective linking is called assortative mixing or homophily and has been widely studied, as it has also in epidemiology. (The term “assortative matching” is also seen in the ecology literature, particularly in reference to mate choice among animals.)” | senses[4] |
| sense | `clustering coefficient` / `fraction of transitive triples` - ONE QUANTITY, TWO FIELD-LOCAL NAMES, and the review is explicit that the DEFINITION is the same one: `The definition of C given here has been widely used in the sociology literature, where it is referred to as the “fraction of transitive triples”.` FILED AS A SENSE AND NOT AS A `renamed-across-fields` EDGE ON PURPOSE: the gate requires a renaming clause to contain BOTH names, and this one calls the physics-side quantity `C` rather than `clustering coefficient`. The only span naming both runs back through Eq. (3). A CLAUSE NAMING ONE NAME IS A DEFINITION, NOT A RENAMING - the gate is right, and the reading survives at the sense layer where it is grounded in what the sentence actually says.— “The definition of C given here has been widely used in the sociology literature, where it is referred to as the “fraction of transitive triples.”” | senses[5] |
| sense | `Vertex` / `site` / `node` / `actor` - ONE OBJECT, FOUR NAMES, AND THE PAPER PRINTS THE DISCIPLINE BESIDE EACH. `The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology).` This is the corpus's cleanest instance of renaming-across-fields: not reconstructed from two papers that never cite each other, but asserted in a glossary by an author who works in all three literatures. The same sentence does it AGAIN for `Edge` / `bond` / `link` / `tie`, with the same three fields in the same order.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | senses[6] |
| sense | `clustering` - A NAME THAT COLLIDES INSIDE ITS OWN FIELD, AND THE PAPER SAYS SO WHILE USING IT. `network transitivity, sometimes also called clustering, although the latter term also has another meaning in the study of networks (see Sec. III.G) and so can be confusing.` The other meaning is community detection. The alias is not across fields - it is a collision WITHIN one, and the author records the ambiguity rather than resolving it.— “network transitivity, sometimes also called clustering, although the latter term also has another meaning in the study of networks (see Sec. III.G) and so can be confusing.” | senses[7] |
| differs in | Barabási and Albert, preferential attachment — WHICH NAME THE MODEL TRAVELS UNDER, AND THE REVIEW SAYS THE EARLIER ONE DID NOT: 'The work of PRICE himself, however, is LARGELY UNKNOWN in the scientific community, and CUMULATIVE ADVANTAGE did not achieve currency as a model of network growth until its REDISCOVERY some decades later by Barabási and Albert, who gave it the new name of preferential attachment.' One mechanism, two names, and the currency followed the second - so a search on either name finds only half the literature— “The work of Price himself, however, is largely unknown in the scientific community, and cumulative advantage did not achieve currency as a model of network growth until its rediscovery some decades later by Barab´asi and Albert [32], who gave it the new name of preferential attachment.”— “who gave it the new name of preferential attachment” | claim_relations[0] |
| differs in | the preferential-attachment model as a model of the Web — WHETHER THE MODEL'S OWN PREDICTION APPEARS IN THE DATA IT IS APPLIED TO. The model implies older vertices have higher degree; 'This correlation between degree and age has been used by Adamic and Huberman to argue against the model as a model of the World Wide Web - they show using actual Web data that there is no such correlation in the real Web.' The refutation is of the model AS APPLIED TO THE WEB, not of the mechanism in general— “This correlation between degree and age has been used by Adamic and Huberman [4] to argue against the model as a model of the World Wide Web—they show using actual Web data that there is no such correlation in the real Web.”— “they show using actual Web data that there is no such correlation in the real Web” | claim_relations[1] |
| differs in | Milgram's small-world experiment — WHAT THE SAME EXPERIMENT IS EVIDENCE FOR. 'there is another conclusion that can be drawn from this experiment which Milgram apparently failed to notice; it was pointed out in 2000 by Kleinberg' - roughly three decades later. The finding was in the data the whole time and needed a different question asked of it, which is the strongest kind of case for a layer that records what a result was taken to show— “However, there is another conclusion that can be drawn from this experiment which Milgram apparently failed to notice; it was pointed out in 2000 by Kleinberg”— “which Milgram apparently failed to notice” | claim_relations[2] |
| audit | scale-free network —operationalised-as→ degree distribution — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the span says only the degree distributions of such networks are scale-free; operationalised-as is loose.— “They are sometimes referred to as scale-free networks [32], although it is only their degree distributions that are scale-free;13 one can and usually does have scales present in other network properties.” | concept_edges[0] |
| note | assortative mixing —same-as→ homophily — 'called assortative mixing OR homophily' - a bare disjunction, no hedge, and the review uses both terms interchangeably thereafter.— “In social networks this kind of selective linking is called assortative mixing or homophily and has been widely studied, as it has also in epidemiology. (The term “assortative matching” is also seen in the ecology literature, particularly in reference to mate choice among animals.)” | concept_edges[1] |
| relation | assortative mixing —same-as→ homophily — the review names them as alternatives for one another in the same clause— “In social networks this kind of selective linking is called assortative mixing or homophily and has been widely studied, as it has also in epidemiology. (The term “assortative matching” is also seen in the ecology literature, particularly in reference to mate choice among animals.)” | concept_edges[1] |
| note | Vertex —renamed-across-fields→ site — THE PAPER NAMES THE DISCIPLINE ITSELF - 'site (physics)' - so the field boundary is the paper's claim, not our inference. 'site' on its own is an ordinary English word; the discipline label is what makes this edge safe to traverse, and it lives here.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[2] |
| relation | Vertex —renamed-across-fields→ site — also called a site (physics)— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[2] |
| note | Vertex —renamed-across-fields→ node — THE PAPER NAMES THE DISCIPLINE ITSELF - 'node (computer science)' - so the field boundary is the paper's claim, not our inference. 'node' on its own is an ordinary English word; the discipline label is what makes this edge safe to traverse, and it lives here.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[3] |
| relation | Vertex —renamed-across-fields→ node — also called a node (computer science)— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[3] |
| note | Vertex —renamed-across-fields→ actor — THE PAPER NAMES THE DISCIPLINE ITSELF - 'actor (sociology)' - so the field boundary is the paper's claim, not our inference. 'actor' on its own is an ordinary English word; the discipline label is what makes this edge safe to traverse, and it lives here.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[4] |
| relation | Vertex —renamed-across-fields→ actor — also called a actor (sociology)— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[4] |
| note | Edge —renamed-across-fields→ bond — THE PAPER NAMES THE DISCIPLINE ITSELF - 'bond (physics)' - so the field boundary is the paper's claim, not our inference. 'bond' on its own is an ordinary English word; the discipline label is what makes this edge safe to traverse, and it lives here.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[5] |
| relation | Edge —renamed-across-fields→ bond — also called a bond (physics)— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[5] |
| note | Edge —renamed-across-fields→ link — THE PAPER NAMES THE DISCIPLINE ITSELF - 'link (computer science)' - so the field boundary is the paper's claim, not our inference. 'link' on its own is an ordinary English word; the discipline label is what makes this edge safe to traverse, and it lives here.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[6] |
| relation | Edge —renamed-across-fields→ link — also called a link (computer science)— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[6] |
| note | Edge —renamed-across-fields→ tie — THE PAPER NAMES THE DISCIPLINE ITSELF - 'tie (sociology)' - so the field boundary is the paper's claim, not our inference. 'tie' on its own is an ordinary English word; the discipline label is what makes this edge safe to traverse, and it lives here.— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[7] |
| relation | Edge —renamed-across-fields→ tie — also called a tie (sociology)— “Vertex (pl. vertices): The fundamental unit of a network, also called a site (physics), a node (computer science), or an actor (sociology). Edge: The line connecting two vertices. Also called a bond (physics), a link (computer science), or a tie (sociology).” | concept_edges[7] |
| audit | network transitivity —renamed-across-fields→ clustering — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the span says transitivity is 'sometimes also called clustering', a term with another meaning; renamed-across-fields is loose.— “network transitivity, sometimes also called clustering, although the latter term also has another meaning in the study of networks (see Sec. III.G) and so can be confusing.” | concept_edges[8] |
| note | network transitivity —renamed-across-fields→ clustering — AN ALIAS THE PAPER SUPPLIES AND SIMULTANEOUSLY WARNS AGAINST: 'although the latter…'. Weight 0.8, not 1.0 - 'sometimes also called' is itself a hedge, and the paper is recording usage it does not endorse.— “network transitivity, sometimes also called clustering, although the latter term also has another meaning in the study of networks (see Sec. III.G) and so can be confusing.” | concept_edges[8] |
| relation | network transitivity —renamed-across-fields→ clustering — sometimes also called clustering— “network transitivity, sometimes also called clustering, although the latter term also has another meaning in the study of networks (see Sec. III.G) and so can be confusing.” | concept_edges[8] |
| weight | network transitivity —renamed-across-fields→ clustering — 0.8— “network transitivity, sometimes also called clustering, although the latter term also has another meaning in the study of networks (see Sec. III.G) and so can be confusing.” | concept_edges[8] |
| evidence status note | concept — THE TERM IS NOT IN THE QUOTE - the quote's 'C' is the clustering coefficient, which the paper defines two paragraphs earlier ('defining a clustering coefficient C thus'). That definition is not quoted because the equation it introduces did not survive text extraction.— “The definition of C given here has been widely used in the sociology literature, where it is referred to as the “fraction of transitive triples.”” | concepts[7] |
| for which use | limitation — the theoretical claims of the review: IT REMAINS TO BE SEEN WHAT THE CRUCIAL THEORETICAL DEVELOPMENTS WILL BE IN THIS AREA— “It remains to be seen what the crucial theoretical developments will be in this area.” | limitations[0] |
| for which use | limitation — the coverage of the survey: THE STUDY OF NETWORKS IS BY NO MEANS A COMPLETE SCIENCE YET, AND MANY OF THE POSSIBILITIES HAVE YET TO BE EXPLORED IN DEPTH— “The study of networks is by no means a complete science yet, and many of the possibilities have yet to be explored in depth, but we will see examples of at least some of the variations described here in the work reviewed in this paper.” | limitations[1] |
| for which use | limitation — every structural measure surveyed: WE DO NOT YET, AS WE DO IN SOME OTHER FIELDS, HAVE A SYSTEMATIC PROGRAM FOR CHARACTERIZING NETWORK STRUCTURE - the measures are ad hoc by the review's own account— “We do not yet, as we do in some other fields, have a systematic program for characterizing network structure.” | limitations[2] |
| for which use | limitation — any structure-to-behaviour claim: STUDIES OF THE EFFECTS OF STRUCTURE ON SYSTEM BEHAVIOR ... ARE STILL IN THEIR INFANCY— “Studies of the effects of structure on system behavior on the other hand are still in their infancy.” | limitations[3] |
| for which use | limitation — the settledness of everything the review surveys: THE STUDY OF COMPLEX NETWORKS IS STILL IN ITS INFANCY— “The study of complex networks is still in its infancy.” | limitations[4] |
| for which use | limitation — the term scale-free network as a description of the whole network: the review states only the degree distribution is scale-free and other properties usually do have scales— “They are sometimes referred to as scale-free networks [32], although it is only their degree distributions that are scale-free;13 one can and usually does have scales present in other network properties.” | limitations[5] |
| for which use | limitation — a published power-law exponent for a citation network: this review records the same author revising his own value in a later paper— “He quoted a value of α = 2.5 to 3 for the exponent of his network. In a later paper he quoted a more accurate figure of α = 3.04 [344].” | limitations[6] |
| study location | Kiel (city) · wikidata · geonames— “[136] have reconstructed the pattern of email communications between five thousand students at Kiel University from logs maintained by email servers” | study_location[0] |
| replication | untested |
| limitation | the crucial theoretical developments in the field remain open— “It remains to be seen what the crucial theoretical developments will be in this area.” | limitations[0] |
| limitation | The review acknowledges that the study of networks is incomplete and that only some of the described network variants are covered by the work it reviews.— “The study of networks is by no means a complete science yet, and many of the possibilities have yet to be explored in depth, but we will see examples of at least some of the variations described here in the work reviewed in this paper.” | limitations[1] |
| limitation | The field reviewed has no systematic programme for characterising network structure, so the measures surveyed may not be the important ones.— “We do not yet, as we do in some other fields, have a systematic program for characterizing network structure.” | limitations[2] |
| limitation | Little can be reported on the third aim of the field - the effect of structure on system behaviour - because that work is only beginning.— “Studies of the effects of structure on system behavior on the other hand are still in their infancy.” | limitations[3] |
| limitation | The review closes by stating that the whole subject it surveys is at an early stage.— “The study of complex networks is still in its infancy.” | limitations[4] |
| limitation | The name in general use is stated to overreach: only the degree distribution is scale-free, while other properties of the same networks do have scales.— “They are sometimes referred to as scale-free networks [32], although it is only their degree distributions that are scale-free;13 one can and usually does have scales present in other network properties.” | limitations[5] |
| limitation | Two different exponents for the same citation network were published by the same author: 2.5 to 3, then 3.04.— “He quoted a value of α = 2.5 to 3 for the exponent of his network. In a later paper he quoted a more accurate figure of α = 3.04 [344].” | limitations[6] |