Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

RSA
2006

favoriteEmaildiscussreport

63views more RSA 2006»

Random cutting and records in deterministic and random trees

13 years 10 months ago

Random cutting and records in deterministic and random trees

Download www2.math.uu.se

We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned random labels. Limit theorems are given for this number, in particular when the tree is a random conditioned Galton

Svante Janson

Real-time Traffic

Random | Rooted Tree | RSA 2006 | Tree |

claim paper

Related Content

» Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optim...

» Random Generation of Deterministic Tree Walking Automata

» Lower Bounds on Learning Random Structures with Statistical Queries

» Parametric random generation of deterministic tree automata

» Window Annealing over Square Lattice Markov Random Field

» Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity

» Randomized vsDeterministic Decision Tree Complexity for ReadOnce Boolean Functions

» Deterministic random walks on regular trees

» Robust Cuts Over Time Combatting the Spread of Invasive Species with Unreliable Biological...

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2006
Where	RSA
Authors	Svante Janson

Comments (0)