Random cutting and records in deterministic and random trees

@inproceedings{Janson2006RandomCA,
  title={Random cutting and records in deterministic and random trees},
  author={Svante Janson},
  year={2006}
}
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. L ... 

Citations

Publications citing this paper.
SHOWING 1-10 OF 75 CITATIONS

The cut-tree of large Galton–Watson trees and the Brownian CRT

VIEW 4 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Generalized gamma approximation with rates for urns, walks and trees

VIEW 7 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Cutting down trees with a Markov chainsaw

VIEW 12 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

On moment sequences and mixed Poisson distributions

VIEW 16 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Record process on the Continuum Random Tree

VIEW 8 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Random Records and Cuttings in Binary Search Trees

  • Combinatorics, Probability & Computing
  • 2010
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2004
2019

CITATION STATISTICS

  • 18 Highly Influenced Citations