Related papers: Height and diameter of brownian tree

We study the Wiener index of a class of trees with fixed diameter and order. A double broom is a tree such that there exist two vertices $u$ and $v$, such that each leaf of $T$ is adjacent to $u$ or $v$. We prove that for a tree $T$ of…

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one". They…

We investigate a new width parameter, the fusion-width of a graph. It is a natural generalization of the tree-width, yet strong enough that not only graphs of bounded tree-width, but also graphs of bounded clique-width, trivially have…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

Let x and y be points chosen uniformly at random from $\Z_n^4$, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order $n^2 (\log n)^{1/6}$, resolving a…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…

We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on $n$ vertices with minimal degree linear in $n$ is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that…

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…

The random split tree introduced by Devroye (1999) is considered. We derive a second order expansion for the mean of its internal path length and furthermore obtain a limit law by the contraction method. As an assumption we need the…

We investigate the size of the embedded regular tree rooted at a vertex in a $d$ regular random graph. We show that almost always, the radius of this tree will be ${1/2}\log n$, where $n$ is the number of vertices in the graph. And we give…

In this article, we introduce Brownian motion on stable looptrees using resistance techniques. We prove an invariance principle characterising it as the scaling limit of random walks on discrete looptrees, and prove precise local and global…

Darwinian spreading of vigor, in addition to quality distribution, is introduced in a tree growth model. The size of any tree, within an even-aged stand, is taken as a measure of an inherited productive capacity, and then combined with…

We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…

We provide a new construction of the Brownian disks, which have been defined by Bettinelli and Miermont as scaling limits of quadrangulations with a boundary when the boundary size tends to infinity. Our method is very similar to the…

Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…