Guillermo Tomás Tetzlaff
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Latest Publications
- 1 June 2002
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 39 (2) , 383-390
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 ≃ logn 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.
- 1 June 2002
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 39 (2) , 383-390
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 ≃ logn 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.
- 1 March 2002
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 39 (02) , 383-390
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 ≃ logn 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.
- 1 March 2002
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 39 (02) , 383-390
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 ≃ logn 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.