Breakage and restoration in recursive trees

Uniform sequential tree-building aggregation of n particles is analyzed together with the effect of the avalanche that takes place when a subtree rooted at a uniformly chosen vertex is removed. For large n, the expected subtree size is found to be ≃ log n both for the tree of size n and the tree tha...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Tetzlaff, G.T.
Formato: JOUR
Materias:
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00219002_v39_n2_p383_Tetzlaff
Aporte de:
id todo:paper_00219002_v39_n2_p383_Tetzlaff
record_format dspace
spelling todo:paper_00219002_v39_n2_p383_Tetzlaff2023-10-03T14:22:35Z Breakage and restoration in recursive trees Tetzlaff, G.T. Aggregation Avalanche Recursive tree Self-organized criticality Uniform sequential tree-building aggregation of n particles is analyzed together with the effect of the avalanche that takes place when a subtree rooted at a uniformly chosen vertex is removed. For large n, the expected subtree size is found to be ≃ log n both for the tree of size n and the tree that remains after an avalanche. Repeated breakage-restoration cycles are seen to give independent avalanches which attain size k (1 ≤ k ≤ n - 1) with probability (k(k + 1))-1 and restored trees that are recursive. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_00219002_v39_n2_p383_Tetzlaff
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Aggregation
Avalanche
Recursive tree
Self-organized criticality
spellingShingle Aggregation
Avalanche
Recursive tree
Self-organized criticality
Tetzlaff, G.T.
Breakage and restoration in recursive trees
topic_facet Aggregation
Avalanche
Recursive tree
Self-organized criticality
description Uniform sequential tree-building aggregation of n particles is analyzed together with the effect of the avalanche that takes place when a subtree rooted at a uniformly chosen vertex is removed. For large n, the expected subtree size is found to be ≃ log n both for the tree of size n and the tree that remains after an avalanche. Repeated breakage-restoration cycles are seen to give independent avalanches which attain size k (1 ≤ k ≤ n - 1) with probability (k(k + 1))-1 and restored trees that are recursive.
format JOUR
author Tetzlaff, G.T.
author_facet Tetzlaff, G.T.
author_sort Tetzlaff, G.T.
title Breakage and restoration in recursive trees
title_short Breakage and restoration in recursive trees
title_full Breakage and restoration in recursive trees
title_fullStr Breakage and restoration in recursive trees
title_full_unstemmed Breakage and restoration in recursive trees
title_sort breakage and restoration in recursive trees
url http://hdl.handle.net/20.500.12110/paper_00219002_v39_n2_p383_Tetzlaff
work_keys_str_mv AT tetzlaffgt breakageandrestorationinrecursivetrees
_version_ 1807319775647367168