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

v2 · 2026-08-30 · History

Domain-specific #

1562

Origin domain

network science

Subdomain

generative models of growing networks

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.

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 prime: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) — more general patterns this builds on

• Copying Mechanism is a kind of Inheritance Prime

  The minimal prospective placement is a strict composition/instantiates edge to live prime:inheritance.

Hierarchy path (1) — routes to 1 parentless root

• Copying Mechanism → Inheritance → 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 (1565 abstractions)

Nearest neighbors

• Subgraph Isomorphism Problem — 0.83
• Probabilistic Graphical Model — 0.82
• Hadwiger number — 0.82
• Grundy Number — 0.81
• Friendly-index set — 0.80

Computed from structural-signature embeddings · 2026-09-08