Related papers: Schr\"oder's problems and scaling limits of random…
Scattering equations for tree-level amplitudes are viewed in the context of string theory. As a result of the comparison we are led to define a new dual model which coincides with string theory in both the small and large $\alpha'$ limit,…
We review some of the results that have been derived in the last years on conformal invariance, scaling limits and properties of some two-dimensional random curves. In particular, we describe the intuitive ideas that lead to the definition…
We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…
The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…
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…
For a functional $\E$ and a peak selection that picks up a global maximum of $\E$ on varying cones, we study the convergence up to a subsequence to a critical point of the sequence generated by a mountain pass type algorithm. Moreover, by…
We will consider cross products of finite graphs with a class of trees that have arbitrarily but finitely long line segments, such as the Fibonacci tree. Such cross products are called tree-strips. We prove that for small disorder random…
We study fluctuations of polynomial linear statistics for discrete Schr\"odinger operators with a random decaying potential. We describe a decomposition of the space of polynomials into a direct sum of three subspaces determining the growth…
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
We study a non-linear Schroedinger equation with a Hartree-type nonlinearity and a localized random time-dependent external potential. Sharp dispersive estimates for the linear Schroedinger equation with a random time-dependent potential…
We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…
The size of the largest common subtree (maximum agreement subtree) of two independent uniform random binary trees on $n$ leaves is known to be between orders $n^{1/8}$ and $n^{1/2}$. By a construction based on recursive splitting and…
Maximal estimates for Schr\"odinger means and convergence almost everywhere of sequences of Schr\"odinger means are studied.
Spatial random permutations were originally studied due to their connections to Bose-Einstein condensation, but they possess many interesting properties of their own. For random permutations of a regular lattice with periodic boundary…