Copying Mechanism¶

Grow a network by sampling an existing prototype node and giving a new node some of the prototype's neighbors, optionally mixed with random links, deletions, or other mutations, so local imitation can generate global degree heterogeneity and clustering.

Version: v3 · 2026-09-19 · History
Domain-specific #: 1562
Domain group: Interdisciplinary & Synthetic
Origin domain: Systems Thinking & Cybernetics
Subdomains: Network Science, Generative Models of Growing Networks → Systems Thinking & Cybernetics
Aliases: Copying model, Copy model, Node-copying model

Core Idea¶

A copying mechanism, more commonly a copying model in network-science literature, is a stochastic network-growth rule in which a new vertex samples an existing vertex as a prototype and inherits some of that prototype's adjacency pattern. Copying may be mixed with direct attachment to the prototype, uniformly random links, loss of copied links, or new links. The invariant is not a single formula but new node + sampled prototype + copied neighborhood structure + probabilistic retention or mutation + repeated graph growth.

The mechanism was developed to explain how a creator can build a new web page by finding a page on a relevant topic and reusing part of its link list.

How would you explain it like I'm…

Copy a Friend's Friends

Imagine making a new web page. Instead of finding all your links yourself, you look at a friend's page about the same thing and copy some of their links, and maybe add a few new ones. When lots of people do that, some pages end up with tons of links pointing to them.

Grow by Copying Links

Think of a network as dots connected by lines, like web pages linked to each other. In a copying mechanism, each time a new dot is added, it picks an existing dot at random as a model and copies some of that dot's connections. It might skip some links, add a few random new ones, or link straight to the model. Repeat that over and over and the network grows. This explains how someone making a new web page might find a page on the same topic and reuse part of its link list. Because of the copying, a few dots end up with lots and lots of links, even though no one ever counted who was most popular.

Prototype-Copying Network Growth

A copying mechanism (usually called a copying model in network science) is a random rule for growing a network. Each new node picks an existing node as a prototype and inherits part of that prototype's connections, often mixed with other moves: linking directly to the prototype, adding random links, dropping some copied links, or adding new ones. It was proposed to explain how the web grows: a person making a page finds a related page and reuses some of its links. Because links are copied, they are statistically dependent, and the result can be very unequal numbers of incoming links. Unlike preferential attachment, it produces that inequality without each new node needing to know every node's degree. A related biological version is gene duplication: a duplicated protein starts with its ancestor's interaction partners, then some are lost and others gained.

A copying mechanism, or copying model, is a stochastic network-growth rule in which each arriving vertex samples an existing vertex as a prototype and inherits some of its adjacency pattern. Variants mix copying with direct attachment to the prototype, uniformly random links, loss of copied links, or new links, so the invariant is structural rather than a single formula: a new node, a sampled prototype, copied neighborhood structure, probabilistic retention or mutation, and repeated growth. The model was developed for the web graph, where a page author finds a topically related page and reuses part of its link list. This purely local operation creates correlated edges and can generate highly skewed in-degree distributions without requiring arriving nodes to have global knowledge of existing degrees. Duplication–divergence models of protein interaction networks realize the same copy-and-modify move: a duplicated protein begins with its ancestor's interaction neighborhood, then loses some interactions and may gain others, under a different biological interpretation.

Scope of Application¶

The abstraction belongs to random graph theory, complex networks, web graph modeling, citation and bibliographic networks, social-network formation, and duplication-based biological-network models. It is used both as an explanatory hypothesis about local formation behavior and as a generative null or comparison model.

The family includes directed fixed-outdegree models, whole-neighborhood node-copying models, partial-duplication models, exponential-arrival variants, and models with deletion or second-neighbor copying. Bhat and colleagues show that even a simple rule—attach to a random target and independently to each target neighbor with probability (p)—has sparse and dense regimes and nontrivial clique transitions.

Clarity¶

For a candidate model, specify: Is the graph directed? What is copied—out-neighbors, in-neighbors, all neighbors, or a sampled subset? How is the prototype chosen? Does the new node link to the prototype? Which probabilities retain, delete, or add edges? Can vertices or edges die? Does one node arrive per step or a whole epoch? Are multiple edges and self-loops allowed?

Manages Complexity¶

Copying mechanisms explain how global structure can arise from local information. An arriving node need not calculate a graph-wide degree ranking; it consults one prototype and its neighborhood. This compresses a difficult network-formation problem into a repeated local rule.

The abstraction also unifies families that otherwise appear unrelated. Web authors reusing link lists, duplicated genes retaining interactions, and papers copying references can be represented by the same prototype-neighborhood-mutation skeleton, while domain-specific parameters remain explicit.

Abstract Reasoning¶

Let (G_t=(V_t,E_t)). At step (t+1), add \(v\notin V_t\), sample prototype \(u\in V_t\), and form candidate edges from a neighborhood (N(u)). In a simple undirected version,

\[ P[(v,w)\in E_{t+1}\mid w\in N(u)] = p. \]

A direct edge ((v,u)) may be mandatory, optional, or absent; innovation may add edges to random \(w\in V_t\).

Knowledge Transfer¶

Literal transfer is valid when vertices arrive, one or more existing vertices serve as neighborhood templates, and inherited edges undergo controlled retention or innovation. Web, citation, social, and protein-interaction models can meet those roles despite different semantics.

The mechanism's portable residue is copy-with-modification along a constructed lineage. Live Inheritance captures a parent, derivative, default structural carry-over, and selective override. Network science adds stochastic prototype sampling, adjacency, graph growth, and emergent topological statistics.

Relationships to Other Abstractions¶

Current abstraction Copying Mechanism Domain-specific

Parents (1) — outgoing typed relations

Copying Mechanism is a kind of Inheritance Prime

At each step, the new vertex is a derivative of a sampled prototype for purposes of adjacency: neighborhood structure carries over by default or probability, with selective deletion, addition, or rewiring.

Hierarchy path (1) — routes to 1 parentless root

Copying Mechanism → is a kind of Inheritance → is a kind of, typical Dependency

Neighborhood in Abstraction Space¶

Copying Mechanism sits in a sparse region of the domain-specific corpus (82^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25