Related papers: Recurrence on the average on trees
On an infinite, radial metric tree graph we consider the corresponding Laplacian equipped with self-adjoint vertex conditions from a large class including $\delta$- and weighted $\delta'$-couplings. Assuming the numbers of different edge…
We study the influence of the seed in random trees grown according to the uniform attachment model, also known as uniform random recursive trees. We show that different seeds lead to different distributions of limiting trees from a total…
A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…
Consider an SDE on a foliated manifold whose trajectories lay on compact leaves. We investigate the effective behavior of a small transversal perturbation of order $\varepsilon$. An average principle is shown to hold such that the component…
In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
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…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
We consider a continuous-time random walk on a regular tree of finite depth and study its favorite points among the leaf vertices. For the walk started from a leaf vertex and stopped upon hitting the root we prove that, in the limit as as…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…
We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…
The basin of infinity of a polynomial map $f : {\bf C} \arrow {\bf C}$ carries a natural foliation and a flat metric with singularities, making it into a metrized Riemann surface $X(f)$. As $f$ diverges in the moduli space of polynomials,…
In this paper, we study the asymptotic behaviour of the number of subtrees and the subtree density for a sequence of trees that converges in the Benjamini-Schramm sense. Benjamini-Schramm convergence, also called local weak convergence,…
We show that, for disjoint domains in the Euclidean space whose boundaries satisfy a non-degeneracy condition, mutual absolute continuity of their harmonic measures implies absolute continuity with respect to surface measure and…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
We suggest that the electroweak Higgs particles can be identified with extra-dimensional components of the gauge fields, which after compactification on a certain topologically non-trivial background become tachyonic and condense. If the…
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…