Related papers: Tripod in uniform spanning tree and three-sided ra…
Consider the classical $(2+1)$-dimensional Solid-On-Solid model above a hard wall on an $L\times L$ box of $\bbZ^2$. The model describes a crystal surface by assigning a non-negative integer height $\eta_x$ to each site $x$ in the box and 0…
Kenyon, Miller, Sheffield, and Wilson (2015) showed how to encode a random bipolar-oriented planar map by means of a random walk with a certain step size distribution. Using this encoding together with the mating-of-trees construction of…
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…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We present a detailed asymptotic analysis of correlation functions for the two component spanning tree on the two-dimensional lattice when one component contains three paths connecting vicinities of two fixed lattice sites at large distance…
We prove an asymptotic crystallization result in two dimensions for a class of nonlocal particle systems. To be precise, we consider the best approximation with respect to the 2-Wasserstein metric of a given absolutely continuous…
We show that any planar straight line graph (PSLG) with $n$ vertices has a conforming triangulation by $O(n^{2.5})$ nonobtuse triangles (all angles $\leq 90^\circ$), answering the question of whether any polynomial bound exists. A nonobtuse…
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…
The stacked triangular lattice has the shape of a triangular prism. In spite of being considered frequently in solid state physics and materials science, its percolation properties have received few attention. We investigate several…
In 1995, Koml\'os, S\'ark\"ozy and Szemer\'edi showed that every large $n$-vertex graph with minimum degree at least $(1/2 + \gamma)n$ contains all spanning trees of bounded degree. We consider a generalization of this result to loose…
We study the minimum spanning tree (MST) problem in the massively parallel computation (MPC) model. Our focus is particularly on the *strictly sublinear* regime of MPC where the space per machine is $O(n^\delta)$. Here $n$ is the number of…
We study spanners in planar domains, including polygonal domains, polyhedral terrain, and planar metrics. Previous work showed that for any constant $\epsilon\in (0,1)$, one could construct a $(2+\epsilon)$-spanner with $O(n\log(n))$ edges…
We continue the study of $\delta$-dispersion, a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many…
We use the Mass Transport Principle to analyze the local recursion governing the resolvent $(A-z)^{-1}$ of the adjacency operator of unimodular random trees. In the limit where the complex parameter $z$ approaches a given location $\lambda$…
The study of conformal restriction properties in two-dimensions has been initiated by Lawler, Schramm and Werner who focused on the natural and important chordal case: They characterized and constructed all random subsets of a given simply…
Given a graph $G$ and a digraph $D$ whose vertices are the edges of $G$, we investigate the problem of finding a spanning tree of $G$ that satisfies the constraints imposed by $D$. The restrictions to add an edge in the tree depend on its…
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…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
In the present paper we establish a clear correspondence between probabilities of certain edges belonging to a realization of the uniform spanning tree (UST), and the states of a fermionic Gaussian free field. Namely, we express the…
Decision trees partition the feature space using hard binary thresholds, assigning identical confidence to instances far from a decision boundary and to those directly on it. We introduce ternary decision trees, which augment each split…