Generalized Copy-Hopping Operators

• Generalized copy-hopping operators are memory-cognizant extensions of Simon’s random-copying model that use age-dependent kernels to weight past entries non-uniformly.
• They replace the uniform copying rule with arbitrary kernels, enabling analysis of finite-memory, exponential, bounded, hyperbolic, and heavy-tailed memory effects within a single framework.
• The operator-theoretic formulation unifies diverse models by linking innovation–copy competition to spectral properties, which determine abundance-tail behaviors from pure power laws to exponential cutoffs.

Searching arXiv for the cited paper and closely related terminology to ground the article in current arXiv records. Generalized copy-hopping operators are memory-cognizant extensions of Simon’s 1955 random-copying neutral model in which the uniform copying rule over all previous sequence entries is replaced by an arbitrary age-dependent kernel $k(a)$. In the generalized formulation, copying at time $t+1$ depends on the age $a=(t+1)-i$ of a candidate source entry born at time $i$, so the copy mechanism is represented by an operator $K_k$ that weights the past non-uniformly. This preserves the innovation–copy competition of the classical model while permitting analytical study and numeric simulation of finite-memory, exponential, bounded, hyperbolic, and heavy-tailed memory effects within a single framework (O'Brien et al., 2021).

1. Classical Simon dynamics and the original copy operator

Simon’s classical random-copying model evolves on a sequence of discrete time steps $t=1,2,\ldots$. At each step $t+1$, one of two events occurs: with probability $\mu$, a brand new variant appears at position $t+1$; with probability $1-\mu$, the new entry $t+1$0 is copied from one of the previous entries $t+1$1, $t+1$2. In the original model, this copy choice is uniform over all $t+1$3 existing entries (O'Brien et al., 2021).

Using the notation $t+1$4 for the variant label of the $t+1$5-th entry and

$t+1$6

for the abundance of variant $t+1$7 at time $t+1$8, the uniform copy kernel is

$t+1$9

Equivalently, for any test function $a=(t+1)-i$0 on the existing entries,

$a=(t+1)-i$1

plus the innovation contribution.

The classical model is analytically tractable through a probability generating function (PGF). If $a=(t+1)-i$2, then, as stated with reference to O’Brien and Gleeson, one obtains the exact difference equation

$a=(t+1)-i$3

whose continuum limit is the Riccati equation

$a=(t+1)-i$4

With boundary condition $a=(t+1)-i$5, the solution is

$a=(t+1)-i$6

From this, one recovers a geometric distribution in $a=(t+1)-i$7, and after averaging over $a=(t+1)-i$8, the model yields the familiar power-law tail

$a=(t+1)-i$9

The significance of the classical operator is that its simplicity is tied directly to the assumption of uniform copying. Generalized copy-hopping operators retain the same discrete-time architecture but relax precisely that assumption.

2. Age-dependent kernels and the generalized copy-hopping operator

The memory-dependent generalization replaces the uniform pick $i$0 by an arbitrary age-kernel $i$1, $i$2, normalized by

$i$3

At time $i$4, the age of a candidate copy born at time $i$5 is

$i$6

The generalized copy-hopping operator $i$7 acts on functions $i$8 on past indices as

$i$9

Accordingly, the probability that the new entry $K_k$0 equals the variant of the $K_k$1-th entry is

$K_k$2

This reformulation makes memory explicit at the operator level. Simon’s uniform rule is recovered as the special case $K_k$3, but the generalized framework permits arbitrarily decaying or truncated memory profiles. The paper’s stated motivation is to move away from the uniform assumption, incorporate memory effects via an arbitrary age-dependent kernel, determine further information regarding the structure of sequences from the classical model, and show that previously proposed memory-dependent models can be studied as specific cases of the same framework (O'Brien et al., 2021).

A plausible implication is that “copy-hopping” is best understood not as a single stochastic rule but as a class of linear operators indexed by the age profile $K_k$4. The resulting heterogeneity of memory is what generates distinct abundance regimes.

3. Master equation, abundance dynamics, and continuum approximation

For a fixed variant $K_k$5 that first appeared at time $K_k$6, let

$K_k$7

During one step $K_k$8, three mutually exclusive events occur:

1. The copy event selects one of the $K_k$9 existing members of $t=1,2,\ldots$0, with probability $t=1,2,\ldots$1, and the abundance jumps $t=1,2,\ldots$2.
2. The copy event selects some other variant, with probability $t=1,2,\ldots$3, and the abundance stays at $t=1,2,\ldots$4.
3. Innovation occurs, with probability $t=1,2,\ldots$5, and the abundance stays at $t=1,2,\ldots$6.

The corresponding exact discrete master equation is

$t=1,2,\ldots$7

where the framework writes

$t=1,2,\ldots$8

In a mean-field continuum approximation $t=1,2,\ldots$9, one writes

$t+1$0

which leads to an integrodifferential equation for the mean abundance $t+1$1: $t+1$2

These equations show how the age-kernel enters the model at two levels. At the discrete level it modulates the one-step transition probabilities. At the continuum level it appears as a memory convolution. This suggests that generalization is not merely a perturbation of Simon’s tail exponent; it changes the effective temporal architecture of replication.

4. Asymptotic regimes and abundance-tail exponents

The generalized framework distinguishes sharply between classical, finite-mean, and heavy-tailed memory regimes (O'Brien et al., 2021).

For the classical kernel $t+1$3, the full sequence-averaged distribution has tail exponent

$t+1$4

For any memory kernel with finite mean

$t+1$5

the infinite-time PGF obeys

$t+1$6

and the single-variant abundance distribution at $t+1$7 has the asymptotic form

$t+1$8

Thus, whenever $t+1$9, the pure power-law exponent becomes $\mu$0 universally, but with an exponential cutoff.

For heavy-tailed memory

$\mu$1

the memory has infinite mean, and one obtains a pure power law for the single-variant abundance: $\mu$2 In this regime, long-range memory kernels slow the decay of the abundance-tail.

The main asymptotic distinction is therefore between finite-mean memory and infinite-mean memory. Finite-mean kernels erase the classical Simon exponent and replace it with a universal $\mu$3 law plus cutoff, whereas heavy-tailed kernels preserve pure power-law behavior but with an exponent continuously controlled by $\mu$4 and $\mu$5. This gives the generalized operator framework a clear taxonomic role: the tail class is encoded by the decay properties of $\mu$6.

5. Canonical kernels and embedded special cases

Several previously proposed memory-dependent models appear as explicit special cases of the generalized operator formalism (O'Brien et al., 2021).

The exponential memory kernel,

$\mu$7

has finite mean $\mu$8. In this case the tail behaves as

$\mu$9

and the mean abundance admits the closed form

$t+1$0

The bounded uniform memory kernel, identified with the BMPG model of Schaigorodsky et al.,

$t+1$1

leads in Laplace space to

$t+1$2

For the regime

$t+1$3

one finds

$t+1$4

and the large-$t+1$5 tail again behaves as

$t+1$6

The hyperbolic memory kernel of Cattuto et al.,

$t+1$7

has marginally divergent mean. In that case one observes a crossover from $t+1$8 to $t+1$9 depending on $1-\mu$0 relative to a cutoff.

These examples clarify the scope of the operator formalism. Exponential and bounded kernels represent finite-memory or effectively finite-mean memory and therefore fall into the $1-\mu$1-with-cutoff class. Hyperbolic and other slowly decaying kernels interpolate toward the infinite-mean regime. The generalized operator thus functions as a unifying language for models that otherwise appear disparate.

6. Operator-theoretic interpretation and terminological scope

The framework also admits a compact operator summary. Defining the linear copy operator $1-\mu$2 on sequence-space $1-\mu$3 by

$1-\mu$4

and an injection operator $1-\mu$5 that with probability $1-\mu$6 injects a new basis-vector $1-\mu$7, the full time-evolution operator on probability vectors is

$1-\mu$8

Within this perspective, the spectral radius and Perron–Frobenius theory of $1-\mu$9 determine whether the system admits a heavy-tailed stationary distribution. When $t+1$00, equivalently $t+1$01, one finds a unique steady PGF $t+1$02 solving

$t+1$03

The singularity of $t+1$04 nearest $t+1$05 controls the tail exponent, and its location depends on $t+1$06, specifically on whether that mean is finite or infinite (O'Brien et al., 2021).

This operator formulation organizes the model’s main outputs—mean-field growth rates, stationary PGFs, and abundance exponents—around spectral properties rather than around a single closed-form counting argument. A plausible implication is that the age-kernel is most naturally viewed as a structural input to the evolution operator, not merely as a phenomenological parameterization of recency.

The phrase “copy-hopping” also appears in a separate usage in scattering-amplitude theory. There, “copy-hopping” from adjoint to symmetric structure constants refers to replacing antisymmetric $t+1$07 by symmetric $t+1$08 in color–kinematics duality and double-copy constructions. That setting emphasizes manifest locality and the spanning of effective photon and graviton operators, rather than age-dependent copying in neutral sequence growth (Carrasco et al., 2022). The two usages share the language of “copy,” but they refer to distinct operator structures and distinct research programs.