# Memory effect in growing trees

Source: [Memory effect in growing trees](<https://www.sota2.com/research/paper/68fa1e457a2b558e293214c3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T14:39:44.514Z

Authors: K.Malarz, K.Kulakowski

Published: 2003-04-30T14:11:26.000Z

## Abstract

We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of the node-node distance distribution. Numerical calculations confirm the result and allow to extend the conclusion to the Barabasi--Albert scale-free trees. The memory effect almost disappears, if subsequent nodes are connected to the network with more than one link.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cond-mat/0304693>)

[PDF](<https://arxiv.org/pdf/cond-mat/0304693.pdf>)