Related papers: The $\ell_{\infty}$ Directed Spanning Forest
Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a…
We study the total $\alpha$-powered length of the rooted edges in a random minimal directed spanning tree - first introduced in Bhatt and Roy (2004) - on a Poisson process with intensity $s \ge 1$ on the unit cube $[0,1]^d$ for $d \ge 3$.…
The Bak-Chen-Tang forest fire model was proposed as a toy model of turbulent systems, where energy (in the form of trees) is injected uniformly and globally, but is dissipated (burns) locally. We review our previous results on the model and…
We introduce a family of loop soup models on the hypercubic lattice. The models involve links on the edges, and random pairings of the link endpoints on the sites. We conjecture that loop correlations of distant points are given by…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
We analytically study the input-output properties of a neuron whose active dendritic tree, modeled as a Cayley tree of excitable elements, is subjected to Poisson stimulus. Both single-site and two-site mean-field approximations incorrectly…
We consider the random wetting transition on the Cayley tree, i.e. the problem of a directed polymer on the Cayley tree in the presence of random energies along the left-most bonds. In the pure case, there exists a first-order transition…
The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…
Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with each point of the process contained in exactly one…
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to…
Consider a search from the root of an ordered tree with $n$ edges to some target node at a fixed distance $\ell$ from that root. We compare the average time complexity of the breadth-first search (BFS) and depth-first search (DFS)…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…
Broadcasting in a computer network is a method of transferring a message to all recipients simultaneously. It is common in this situation to use a tree with many leaves to perform the broadcast, as internal nodes have to forward the…
We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a model selection…
Many forest management planning decisions are based on information about the number of trees by species and diameter per unit area. This information is commonly summarized in a stand table, where a stand is defined as a group of forest…
The Ly$\alpha$ forest provides one of the best means of mapping large-scale structure at high redshift, including our tightest constraint on the distance-redshift relation before cosmic noon. We describe how the large-scale correlations in…
We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of…
Density-based directed distances -- particularly known as divergences -- between probability distributions are widely used in statistics as well as in the adjacent research fields of information theory, artificial intelligence and machine…