Memory effect in growing trees

Simple item page
dc.creatorMalarz, K.
dc.creatorKulakowski, K.
dc.date2003-04-30
dc.date2004-06-18
dc.date.accessioned2026-07-07T02:51:05Z
dc.date.available2026-07-07T02:51:05Z
dc.descriptionWe 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.
dc.description9 pages, 9 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0304693
dc.identifierhttp://arxiv.org/abs/cond-mat/0304693
dc.identifierPhysica A345 (2005) 326
dc.identifierdoi:10.1016/j.physa.2004.07.026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/21326
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleMemory effect in growing trees
dc.typetext

Files

Collections

arXiv