• Aucun résultat trouvé

Conditioned brownian trees

N/A
N/A
Protected

Academic year: 2022

Partager "Conditioned brownian trees"

Copied!
35
0
0

Texte intégral

Références

Documents relatifs

We use our result to prove that the scaling limit of finite variance Galton–Watson trees conditioned on the number of nodes whose out-degree lies in a given set is the

The expected lifetime of conditioned Brownian motion in a simply connected planar domain D is by now quite well understood. It is sufficient to consider the case when the

In addition, L 3/2 is the scaling limit of the boundary of (critical) site percolation on Angel & Schramm’s Uniform Infinite Planar Triangulation. Theorem (Curien

Keywords: minimum spanning tree, minimum spanning trees problem, asymp- totically optimal algorithm, probabilistic analysis, bounded below, performance guarantees, random

In the critical case H = 1/6, our change-of-variable formula is in law and involves the third derivative of f as well as an extra Brownian motion independent of the pair (X, Y

We focus here on results of Berestycki, Berestycki and Schweinsberg [5] concerning the branching Brownian motion in a strip, where particles move according to a Brownian motion

In this paper, we study complex valued branching Brownian motion in the so-called glassy phase, or also called phase II.. In this context, we prove a limit theorem for the

Similarly, [4] also considered a model related to the 2-dimensional branching Brownian motion, in which individuals diffuse as Brownian motions in one direction, and move at