Título: A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
Autores: Iksanov, Alex; National Taras Shevchenko University of Kiev
Möhle, Martin; University of Tuebingen
Fecha: 2007-01-01
Publicador: Electronic communications in probability
Fuente:
Tipo: Peer-reviewed Article

Tema: coupling; random recursive tree; random walk; stable limit
Primary: 60F05; 60G50; Secondary 05C05; 60E07
Descripción: 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 random walk.
Idioma: No aplica

Artículos similares:

Simulations and Conjectures for Disconnection Exponents por Puckette, Emily E.; Occidental College,Werner, Wendelin; Université Paris-Sud and IUF
A Proof of a Conjecture of Bobkov and Houdré por Kwapien, S.; Warsaw University,Pycia, M.; Warsaw University,Schachermayer, W.; University of Vienna
Excursions Into a New Duality Relation for Diffusion Processes por Jansons, Kalvis M.; University College London
Moderate Deviations for Martingales with Bounded Jumps por Dembo, Amir; Stanford University
Percolation Beyond $Z^d$, Many Questions And a Few Answers por Benjamini, Itai; Weizmann Institute of Science,Schramm, Oded; Microsoft Research
Bounds for Disconnection Exponents por Werner, Wendelin; Université Paris-Sud and IUF
Transportation Approach to Some Concentration Inequalities in Product Spaces por Dembo, Amir; Stanford University,Zeitouni, Ofer; Technion - Israel Institute of Technology
The Dimension of the Frontier of Planar Brownian Motion por Lawler, Gregory F.; Duke University
10 
Surface Stretching for Ornstein Uhlenbeck Velocity Fields por Carmona, Rene; Princeton University,Grishin, Stanislav; Princeton University,Xu, Lin; Princeton University,Molchanov, Stanislav; University of North Carolina at Charlotte