OpenAlex | A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree

A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree

Work

Year: 2007

Type: article

Abstract: We present a short probabilistic proof of a weak convergence result for the number of cuts needed to isolate the root of a random recursive tree. The proof is based on a coupling related to a certain ... more

Source: Electronic Communications in Probability

Authors Alexander Iksanov, Martin Möhle

Institutions Taras Shevchenko National University of Kyiv, University of Tübingen

Cites: 14

Cited by: 90

Related to: 10

FWCI: 6.937

Citation percentile (by year/subfield): 95.58

Topic: Stochastic processes and statistical mechanics

Subfield: Mathematical Physics

Field: Mathematics

Domain: Physical Sciences

Sustainable Development Goal Peace, justice, and strong institutions

Open Access status: gold

APC paid (est): $675