Introduction. A network motif is a small subgraph—three or four nodes with a specified pattern of directed edges—that occurs in a real network significantly more often than in randomised networks with the same degree sequence. Milo and colleagues introduced the method in 2002 by scanning transcription networks, neural wiring, food webs, electronic circuits and the web, and found that each class of network has a characteristic motif signature. In information-processing networks the dominant three-node motif is the feed-forward loop (FFL): X regulates Y, and both X and Y regulate Z. Because each edge can activate or repress, there are eight FFL types. Mangan and Alon showed analytically and by simulation that the four coherent types act as sign-sensitive delay elements: with AND logic at the target, the circuit responds at once to a signal switching off but only after a delay to a signal switching on, so brief pulses in one direction are rejected while persistent ones pass. Mangan, Zaslaver and Alon confirmed this in living E. coli. Two facts matter for a practitioner: the function was derived from topology and then measured, and the direction of the asymmetry reverses when the input logic at Z changes from AND to OR.
Important authors. Uri Alon at the Weizmann Institute of Science leads the programme; his laboratory introduced motif analysis (with Ron Milo, Shai Shen-Orr and others) and wrote the standard textbook on design principles of biological circuits. Shmoolik Mangan and Alon Zaslaver were members of that laboratory when the FFL papers appeared. The motif method is now a standard tool of network science, and its statistical foundations—especially the choice of null model—have been debated by Lior Stone’s group in Tel Aviv and by Michael Stumpf’s group in London, among others.
Importance for cybernetics and the VSM. Beer claims that System Two damps oscillation and filters transient disturbance so that local noise does not reach the metasystem. He asserted the function; the motif literature derived the same function from the same topology, since S1→S2, S2→S3 and S1→S3 together form a coherent FFL. That is the strongest structural result available to the model, and nobody in the VSM tradition has claimed it. Cybernetics generally has treated channels as carrying variety and has not asked what a specific wiring pattern computes. The motif method also gives a way to ask whether the VSM’s drawn structure is over-represented in real organisational communication graphs at all.
Importance for the article. Demonstration II (§7.1, claim IIb; §7.2–7.4) makes the FFL identification carry a novel, risky prediction: with a functioning System Two, escalation latency should differ between a disturbance appearing and the same disturbance clearing. §4.7 lists this as one of three candidate novel corroborated predictions on which the programme’s Lakatosian verdict turns. The import is from Variety and Channels Now §2 (C4). A reviewer will press on three points: the sign of the asymmetry depends on the input function at System Three, which Beer left as “transduction” and never specified—the receipt therefore requires it to be fixed before the prediction is; the biological result holds for transcription kinetics, and its transfer to organisational escalation is an analogy until the state variables and update rules of §9.1 (IVa) exist; and, as Ingram and colleagues showed, motif structure alone does not determine function—parameters do. §7.4 states what is withdrawn if IIb fails with the input function specified.
Sources in the reading list.
- the definition of a motif and the null-model comparison procedure.
- the eight FFL types, the AND/OR dependence and the sign-sensitive delay derivation.
- the experimental confirmation in E. coli; the model of a prediction that could have failed.
Other important sources and authors.
- Shen-Orr, S. S., Milo, R., Mangan, S., & Alon, U. (2002). Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genetics, 31(1), 64–68 — the first motif paper; the FFL, single-input module and dense overlapping regulon.
- Alon, U. (2007). Network motifs: theory and experimental approaches. Nature Reviews Genetics, 8(6), 450–461 — the review to read for the full catalogue of motif functions.
- Alon, U. (2006). An Introduction to Systems Biology: Design Principles of Biological Circuits. Chapman & Hall/CRC — the textbook; chapters on the FFL and on robustness are directly relevant.
- Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004). Superfamilies of evolved and designed networks. Science, 303(5663), 1538–1542 — motif significance profiles as a way of classifying networks; relevant to comparing a VSM graph against known families.
- Artzy-Randrup, Y., Fleishman, S. J., Ben-Tal, N., & Stone, L. (2004). Comment on “Network motifs: simple building blocks of complex networks” and “Superfamilies of evolved and designed networks”. Science, 305(5687), 1107 — shows motif over-representation can be an artefact of the null model; the caution a reviewer will raise.
- Ingram, P. J., Stumpf, M. P. H., & Stark, J. (2006). Network motifs: structure does not determine function. BMC Genomics, 7, 108 — the same topology yields different dynamics under different parameters; why IIb needs the input function and rates specified.