Cutting down very simple trees

By Alois Panholzer. 2006

63 citations recorded by the source corpus.

Subfields: Mathematical Physics, Statistics and Probability, Signal Processing

View Paper: https://www.semanticscholar.org/paper/39ce7de93b004d534122e0ab09afff1e43685ef5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Mathematical Physics

1. Louigi Addario-Berry
2. Nicolas Broutin
3. Cecilia Holmgren
4. Helmut Prodinger
5. Alois Panholzer

In Statistics and Probability

1. Louigi Addario-Berry
2. Nicolas Broutin
3. Cecilia Holmgren
4. Helmut Prodinger
5. Alois Panholzer

In Signal Processing

1. Louigi Addario-Berry
2. Nicolas Broutin
3. Cecilia Holmgren
4. Helmut Prodinger

Citations in the corpus

• An almost-bijective proof of an asymptotic property of partitions (2007, background): “analysed in [ 13 ], where a complete characterization of degree-weight generating functions”
• Cutting down trees with a Markov chainsaw (2011, methodology): “Essentially two kinds of random models have been considered for the tree: recursive trees with typical inter-node distances of order log n [18, 21, 22, 36], and trees arising from critical, finite variance branching processes conditioned to have size n, with typical distances of order √ n [19, 23, 2”