---
title: 'TRE: Quantifying Tree Reconstruction Error'
url: https://www.emergentmind.com/topics/tree-reconstruction-error-tre
type: topic
---

# TRE: Quantifying Tree Reconstruction Error

Tree Reconstruction Error (TRE) quantifies the topological discrepancy between an original rooted tree and its reconstruction, particularly under perturbations of the node sampling order. It is formally defined in terms of edge-wise agreement between adjacency structures, using a coincidence similarity index that incorporates both the Jaccard and Interiority measures. TRE is a unit interval metric with $\mathrm{TRE} = 0$ signifying perfect reconstruction and $\mathrm{TRE} \to 1$ indicating maximal dissimilarity. The framework enables rigorous quantification of accuracy loss in applications such as phylogenetics, ontology extraction, and hierarchical data mining when information is accessed or discovered in noisy, out-of-order sequences [2204.07530].

## 1. Generative Model for Rooted Trees

TRE analysis employs a stochastic, single-parameter model to generate rooted trees of size $N$ with continuously tunable "branchiness." Each node $i=1,\dots, n$ at construction is characterized by hierarchical level $h_i$ (measured from the root) and current degree $k_i$ (number of attached children). When adding the $(n+1)$th node, its parent $i$ is chosen at random with probability
\[
p_i = \frac{(h_i+1)\, (k_i)^\gamma}{\sum_{j=1}^{n}(h_j+1)\, (k_j)^\gamma}
\]
where $\gamma \in \mathbb{R}$ tunes the tree’s topology:
- $\gamma \ll 0$ generates chain-like trees (minimal branching).
- $\gamma \gg 0$ generates bushy, highly branched trees.

The process is iterated until $n = N$. Representative morphologies for $\gamma \in \{-3, -1, 0, 1, 3\}$ are provided to illustrate the continuum from linear to highly branched hierarchies [2204.07530].

## 2. Sampling-Order Perturbations

To simulate realistic reconstruction scenarios, the procedure imposes random perturbations on the canonical node sampling order $\sigma = (v_1, v_2, ..., v_N)$. Each element $v_t$ is independently marked for potential displacement with probability $p$, and moved randomly within a window of at most $\pm\delta$ positions of its original index. Parameters:
- $p \in [0,1]$: the fraction of nodes sampled "out of order."
- $\delta \in \{1,2,3,4\}$: maximum positional displacement per shuffled node.

This model directly controls the incidence and severity of sampling-order errors, distinguishing between how frequently nodes are misordered ($p$) and by how much each can be displaced ($\delta$). Such errors mimic realistic acquisition noise in empirical data, permitting study of their impact on topological recovery [2204.07530].

## 3. Coincidence Similarity and Mathematical Formulation of TRE

The error metric compares the original tree $T$ to a reconstruction $T'$ by flattening their adjacency matrices $A_T,\,A_{T'}$ to edge incidence vectors $X, Y \in \{0,1\}^M$ ($M = \frac{1}{2}N(N-1)$ possible undirected edges). Three quantitative indices are defined:
- **Jaccard index**
  \[
  \mathcal{J}(X, Y) = \frac{\sum_i \min\{x_i, y_i\}}{\sum_i \max\{x_i, y_i\}} \in [0,1]
  \]
- **Interiority index**
  \[
  \mathcal{I}(X, Y) = \frac{\sum_i \min\{x_i, y_i\}}{\min\{\sum_i x_i, \sum_i y_i\}} \in [0,1]
  \]
- **Coincidence similarity**
  \[
  \mathcal{C}(X, Y) = \mathcal{J}(X, Y) \times \mathcal{I}(X, Y) \in [0,1]
  \]

The **Tree Reconstruction Error** is then defined as:
\[
\mathrm{TRE}(T, T') = 1 - \mathcal{C}\big(\mathrm{vec}(A_T),\,\mathrm{vec}(A_{T'})\big)
\]
where $\mathrm{vec}(\cdot)$ indicates vectorization. This metric robustly penalizes both missing and spurious edges, ensuring that $\mathrm{TRE}$ is sensitive to topological inconsistencies.

## 4. Empirical Analysis: Monte Carlo Evaluation

Closed-form analytical expressions for $\mathbb{E}[\mathrm{TRE}]$ and $\mathrm{Std}[\mathrm{TRE}]$ are not provided. Instead, extensive Monte Carlo studies parameterize $\gamma$, $p$, and $\delta$ with $N = 15$, averaging over 30 random trees and 4000 sampling orders per tree:
\[
\langle \mathrm{TRE} \rangle = 1 - \langle \mathcal{C} \rangle, \quad \mathrm{Std}[\mathrm{TRE}] = \mathrm{Std}[\mathcal{C}]
\]
Findings include:
- $\langle\mathrm{TRE}\rangle$ increases monotonically with $p$, showing a sigmoidal response, steepest at low $p$.
- $\langle\mathrm{TRE}\rangle$ depends only weakly on $\gamma$ (branchiness) and $\delta$ (disorder extent).
- $\mathrm{Std}[\mathrm{TRE}]$ grows with $p$ but is minimally affected by $\gamma$ and $\delta$.
- The coincidence mode evidences stronger dependence on $\gamma$ and $\delta$ than the mean.

Representative values at $p=0.5$ are $\langle\mathrm{TRE}\rangle \in [0.4, 0.6]$ and $\mathrm{Std}[\mathrm{TRE}] \approx 0.2$–0.3. Figures 5–7 of the reference provide supporting statistics and sensitivity plots [2204.07530].

## 5. Observed Impacts of Error Parameters

Key empirical results include:
- Moderate increases in $\delta$ (up to 4) or changes in tree structure parameter $\gamma$ shift $\langle\mathrm{TRE}\rangle$ by only a few percent for fixed $p$.
- Increasing the sampling disorder probability $p$ from $0$ to $0.5$ raises $\langle\mathrm{TRE}\rangle$ from near $0$ up to approximately $0.4$–$0.6$.
- The sensitivity $|\frac{d\langle C\rangle}{dp}|$ is maximal at low $p$ (typically $0 \le p \le 0.1$) and decreases as $p$ increases.
- Even a $10\%$ rate of out-of-order sampling ($p=0.1$) can reduce edge-wise coincidence by $10$–$20\%$, while subsequent increases in $p$ yield diminishing effects.

These trends indicate that the dominant determinant of reconstruction fidelity is $p$, the error probability, rather than the specific tree topology or maximum error extent.

## 6. Practical Applications and Guidance

The TRE framework provides a precise and operational error metric for hierarchical data systems vulnerable to noisy, non-canonical sampling sequences:
- Systems able to control $p$ below $0.1$ typically achieve above $90\%$ edge-wise topological correctness.
- Experimental procedures in phylogenetics, ontology discovery, and tree-based incremental data mining benefit from prioritizing sampling-order reliability over concerns about the precise global branching structure.
- The quantitative calibration of mean and variance in TRE, together with the underlying generative and noise model, facilitates predictive assessment of reconstruction fidelity under empirically realistic error regimes.

Summary points:
- TRE is a mathematically grounded, topological error metric derived from coincidence similarity.
- The single-parameter generative tree model efficiently spans the spectrum from chain to bushy topologies.
- Controlled perturbation models ($p$, $\delta$) realistically emulate imperfect sampling.
- Empirical benchmarks furnish practitioners with actionable expectations for accuracy and variability [2204.07530].

Source: https://www.emergentmind.com/topics/tree-reconstruction-error-tre