Related papers: Random trees in the boundary of Outer space

We study a class of tridiagonal matrix models, the "q-roots of unity" models, which includes the sign ($q=2$) and the clock ($q=\infty$) models by Feinberg and Zee. We find that the eigenvalue densities are bounded by and have the…

A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…

In a recent paper Chatterji and Niblo proved that a geodesic metric space is Gromov hyperbolic if and only if the intersection of any two closed balls has uniformly bounded eccentricity. In their paper, the authors raise the question…

We prove a strong law of large numbers and an annealed invariance principle for a random walk in a one-dimensional dynamic random environment evolving as the simple exclusion process with jump parameter $\gamma$. First, we establish that if…

We show that for lazy simple random walks on finite spherically symmetric trees, the ratio of the mixing time and the relaxation time is bounded by a universal constant. Consequently, lazy simple random walks on any sequence of finite…

We study behavior in space and time of random walks in an i.i.d. random environment on Z^d, d>=3. It is assumed that the measure governing the environment is isotropic and concentrated on environments that are small perturbations of the…

We present a new class of metrics for unrooted phylogenetic $X$-trees derived from the Gromov-Hausdorff distance for (compact) metric spaces. These metrics can be efficiently computed by linear or quadratic programming. They are robust…

We study the phase diagram of random outerplanar maps sampled according to non-negative Boltzmann weights that are assigned to each face of a map. We prove that for certain choices of weights the map looks like a rescaled version of its…

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its…

We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Let $(X,\mathcal{A}, \mu)$ be a probability measure space and let $T_i,$ $1\leq i\leq H,$ be invertible bi measurable measure preserving transformations on this measure space. We give a sufficient condition for the product of $H$ bounded…

We determine the asymptotic behavior of the Green function for zero-drift random walks confined to multidimensional convex cones. As a consequence, we prove that there is a unique positive discrete harmonic function for these processes (up…

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

We establish a dimension formula for the harmonic measure of a finitely supported and symmetric random walk on a hyperbolic group. We also characterize random walks for which this dimension is maximal. Our approach is based on the Green…

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…