Related papers: On the statistical physics of directed polymers in…

The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.

In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…

We consider the unbinding of a directed polymer in a random media from a wall in $d=1+1$ dimensions and a simple one-dimensional model for DNA unzipping. Using the replica trick we show that the restricted partition functions of these…

We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…

In this paper we consider random walks on Galton-Watson trees with random conductances. On these trees, the distance of the walker to the root satisfies a law of large numbers with limit the effective velocity, or speed of the walk. We…

We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…

Over the past decade, random forest models have become widely used as a robust method for high-dimensional data regression tasks. In part, the popularity of these models arises from the fact that they require little hyperparameter tuning…

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…

Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional…

We study the model of Directed Polymers in Random Environment in 1+1 dimensions, where the distribution at a site has a tail which decays regularly polynomially with power \alpha, where \alpha \in (0,2). After proper scaling of temperature…

For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

This is the second in a series of two works which study the discrete Gaussian free field on the binary tree when all leaves are conditioned to be positive. In the first work ("Gaussian free field on the tree subject to a hard wall I:…

The exact symmetry identities among four-point tree-level amplitudes of bosonic open string theory as derived by G. W. Moore are re-examined. The main focuses of this work are: (1) Explicit construction of kinematic configurations and a new…

Cette these est consacree a l' etude de differents modeles aleatoires de polymeres. On s'interesse en particulier a l'influence du desordre sur la localisation des trajectoires pour les modeles d'accrochage et pour les polymeres diriges en…

In this paper we start a systematic study of quantum field theory on random trees. Using precise probability estimates on their Galton-Watson branches and a multiscale analysis, we establish the general power counting of averaged Feynman…

We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code…

We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a binary tree $T$ on $n$ leaves with a path metric $d$, consider the pairwise distances $\{d(u,v)\}$ between leaves. It is well known that these…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

A {\em tree cover} of a metric space $(X,d)$ is a collection of trees, so that every pair $x,y\in X$ has a low distortion path in one of the trees. If it has the stronger property that every point $x\in X$ has a single tree with low…