---
title: Duplication-Divergence Growing Graphs
url: https://www.emergentmind.com/topics/duplication-divergence-growing-graphs
type: topic
---

# Duplication-Divergence Growing Graphs

Duplication-divergence growing graphs are a class of stochastic network models in which network evolution is driven by the mechanisms of node (vertex) duplication and subsequent divergence, typically via partial retention or deletion of edges. This framework was developed to capture structural properties observed in real-world systems such as biological, protein–protein interaction, and social networks, where new vertices arise by copying the interaction patterns of existing ones but undergoing random displacement of links. These models are mathematically tractable and serve as canonical descriptions for the emergence of heterogeneous degree distributions, high clustering, and modular connectivity in large-scale sparse networks.

## 1. Formal Model Definition

A canonical duplication-divergence model, such as the $DD(t,p,r)$ model, operates as follows [2308.04336]:

- Start with an initial simple graph $G_{t_0}$ on $t_0$ vertices.
- For each time step $i = t_0, ..., t-1$:
  1. Add a new vertex $v = i+1$.
  2. Select a parent vertex $u$ uniformly at random from the current vertex set $V(G_i)$.
  3. For every existing vertex $w \in V(G_i)$:
     - If $(u,w)\in E(G_i)$, attach $(v,w)$ independently with probability $p$.
     - If $(u,w)\notin E(G_i)$, attach $(v,w)$ independently with probability $r/i$ (for background rewiring).
- Bernoulli trials are independent.

This encompasses pure and partial duplication, allowance for background mutation ($r$), as well as tunable divergence probability ($1-p$).

Several generalizations exist:
- Asymmetric/symmetric coupled divergence: Different probabilities for edge loss from parent and copy [2409.16943, 2601.07024].
- Additional mutation/dimerization steps: New random links or enforced $(i, i')$ connections [2506.15640].
- Edge/vertex deletion or rewiring between steps [2105.14227].

For directed graphs, edges may be duplicated only in the outgoing or incoming direction, possibly also adding deterministic citations to the parent [1807.01591].

## 2. Degree Distribution and Concentration Phenomena

The asymptotic degree distribution in duplication-divergence models exhibits rich phenomenology:

- **Concentration of Maximum and Average Degree**:
  - For the $DD(t,p,r)$ model and any $0<p<1$:
    - The maximum degree $\Delta(G_t)$ is concentrated around $t^p$, up to polylogarithmic factors, with failure probability at most $t^{-A}$ for any $A>0$: for any $\alpha>0$,
      \[
      \Pr\left[(1-\alpha) t^p \leq \Delta(G_t) \leq (1+\alpha)\,t^p\,\log^{2-p^2}(t)\right] \geq 1 - t^{-A}.
      \]
    - The average degree $D_t$ scales as $\max\{t^{2p-1}, 1\}$, with similar high-probability bounds [2308.04336].

- **Threshold and Phase Regimes**:
  - For $p \leq 1/2$, $D_t = \Theta(\max\{1, \ln t\})$.
  - For $p > 1/2$, $D_t$ sharply concentrates around $\Theta(t^{2p-1})$ [2308.04336].
  - There is no phase transition in the scaling of the maximum degree at $p=1/2$, in contrast to the average degree [2308.04336].

- **Tail Behavior**:
  - In basic models with background mutation ($r=0$), the limiting degree distribution is not always pure power-law:
    - With specific duplication/deletion rules, the degree distribution decays as a stretched-exponential:
      \[
      p_d \sim \sqrt{e\pi}\,d^{1/4}\,\exp(-2\sqrt d),\quad d\to\infty
      \]
      [1308.1506].
    - In mean-field models, a power-law tail $n_k\sim k^{-\gamma}$ with exponent $\gamma$ solving
      \[
      \gamma = 3 - p^{\gamma-2}
      \]
      can emerge in specific partial-duplication regimes [2506.15640].

- **Central Limit Theorem for Log-Degree**:
  - For robust supercritical duplication-divergence models, a central limit theorem holds for the log-degree:
    \[
    \frac{\log D_t - \alpha t}{\sqrt{t}} \Longrightarrow N(0, v^2)
    \]
    where $\alpha$ and $v$ are effective birth/catastrophe rates [2105.14227].

## 3. Parameter Regimes, Structural Transitions, and Component Behavior

Parameter tuning in duplication-divergence models controls key network properties [2506.15640, 2409.16943, 2601.07024]:

- **Divergence Rate ($\delta$) and Densification**:
  - Edge retention probability $p=1-\delta$.
  - For $\delta<1/2$, the expected number of edges grows superlinearly with time; the network densifies.
  - For $\delta>1/2$, graphs remain sparse; average degree and edge count grow sublinearly.

- **Asymmetry Parameter ($\sigma$) in Divergence** [2409.16943]:
  - $\sigma=1$ or $0$ yields complete asymmetric divergence (edges lost only from copy or parent, one giant component).
  - $\sigma=1/2$ yields symmetric divergence (edges lost with equal probability, generation of fragmented components with power-law distributed sizes).

- **Component Size and Percolation**:
  - Models with symmetric divergence (e.g., $\sigma=1/2$) exhibit a nontrivial phase transition in the emergence of a giant component as divergence increases.
  - For the symmetric coupled divergence model, the critical divergence rate $\delta_c$ for the appearance of a giant component is numerically estimated as $\delta_c=0.600\pm0.002$ [2601.07024].
  - The component-size distribution follows $C_s\sim s^{-\lambda}$, with $\lambda\approx 5/3$ for $\delta \approx 0.7$, evidencing heavy-tailed modularity [2409.16943].

- **Euler Characteristic**:
  - The locus where the Euler characteristic $\chi(G_t) = t - E(\delta, t)$ vanishes marks a singularity in network structure and coincides with the percolation transition [2601.07024].

## 4. Analytical Techniques and Proof Schemes

Multiple rigorous and mean-field analytical techniques have been deployed [2308.04336]:

- **Martingale and Chernoff-type Concentration**:
  - Proofs for maximum and average degree concentration use telescoping meshes, careful deterministic envelopes, and repeated application of Chernoff bounds on degree increments.
  - Martingale methods establish convergence (and concentration) of the total degree and its increments.
  - Central recurrences for degree growth mimic polynomial trajectories ($t^p$, $t^{2p-1}$).

- **Master Equation Analysis**:
  - Degree distributions are derived from master equations for vertex counts of given degree (often using binomial thinning per copied edge).
  - Linear recurrences, eigen-decomposition of the transition matrix, and asymptotics (via generating functions) yield stationary or non-stationary degree laws [1711.09844, 2506.15640].

- **Markov Chain and Birth-Catastrophe Process Embeddings**:
  - Tagged-vertex Markov chains with duplication (birth) and divergence (catastrophe) transitions map the evolution of degree for specific vertices.
  - Quasi-stationary distributions and critical behavior are characterized by spectral equations for the Markov transition generator.

- **Union Bounds and High-Probability Analysis**:
  - Application of Chernoff-type union bounds over vertices and time steps ensures superpolynomial concentration of extremal quantities [2308.04336].

## 5. Open Problems and Structural Invariants

Despite extensive progress, several open questions persist [2308.04336, 2506.15640]:

- The exact limiting law and support of the normalized maximum degree $\Delta(G_t)/t^p$ remain undetermined.
- Proving the existence of a true power-law degree tail in the generic $DD(t,p,r)$ model is unresolved, with known special cases showing only stretched-exponential decay [1308.1506].
- The full degree distribution, especially in models with background mutation or asymmetric divergence, lacks a comprehensive description.
- Further analysis is needed on component sizes, motif frequencies, graph automorphism groups, and efficient encoding schemes for duplication-divergence-generated networks.

## 6. Biological and Network Science Relevance

Duplication-divergence models capture central aspects of biological network evolution, such as gene or protein duplication followed by interaction loss [2506.15640]. Empirical tests on biological datasets, such as protein-protein interaction or genetic regulatory networks, reveal signatures (e.g., negative deviation from expected distinguishability number) consistent with pure duplication–deletion histories [2107.12352].

The general class of models unifies fundamental mechanisms in network science:
- Emergence of scale-free (or nearly scale-free) degree distributions.
- High clustering and modularity, exceeding those of preferential-attachment or Erdős–Rényi graphs.
- Phase transitions in connectivity structure driven by model parameters.

The duplication-divergence framework thus underpins a statistical-mechanics approach to natural network formation and has become a touchstone for analytic exploration of non-equilibrium network growth [2506.15640, 2601.07024, 2308.04336].

---

**Key References:**

- "On the concentration of the maximum degree in the duplication-divergence models" [2308.04336]
- "Duplication-divergence growing graph models" [2506.15640]
- "Divergence asymmetry and connected components in a general duplication-divergence graph model" [2409.16943]
- "Largest connected component in duplication-divergence growing graphs with symmetric coupled divergence" [2601.07024]
- "Asymptotic properties of a random graph with duplications" [1308.1506]
- "Genetic Networks Encode Secrets of Their Past" [2107.12352]
- "The expected degree distribution in transient duplication divergence models" [2105.14227]
- "Large-scale behavior of the partial duplication random graph" [1408.0904]

Source: https://www.emergentmind.com/topics/duplication-divergence-growing-graphs