Related papers: Random spanning forests and hyperbolic symmetry

Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly…

We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical…

We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite…

A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and…

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

Consider a point particle moving through a Poisson distributed array of cubes all oriented along the axes - the random wind-tree model introduced in Ehrenfest-Ehrenfest (1912). We show that, in the joint Boltzmann-Grad and diffusive limit…

We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…

We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…

The minimal spanning forest on $\mathbb{Z}^{d}$ is known to consist of a single tree for $d \leq 2$ and is conjectured to consist of infinitely many trees for large $d$. In this paper, we prove that there is a single tree for quasi-planar…

We explore the consequences of Replica Symmetry Breaking at zero temperature. We introduce a repulsive coupling between a system and its unperturbed ground state. In the Replica Symmetry Breaking scenario a finite coupling induces a non…

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the…

The properties of scale-free random trees are investigated using both preconditioning on non-extinction and fixed size averages, in order to study the thermodynamic limit. The scaling form of volume probability is found, the connectivity…

Tree-based ensemble methods, as Random Forests and Gradient Boosted Trees, have been successfully used for regression in many applications and research studies. Furthermore, these methods have been extended in order to deal with uncertainty…

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…

We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with…