Related papers: The 2d-directed spanning forest converges to the B…
We consider the $n$-dimensional random temporal hypercube, i.e., the $n$-dimensional hypercube graph with its edges endowed with i.i.d. continuous random weights. We say that a vertex $w$ is accessible from another vertex $v$ if and only if…
We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We present deterministic…
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R^2 and a query distribution D for 2-sided orthogonal range counting queries. The expected query time for this data structure, when queries…
In Bayesian learning of Gaussian graphical model structure, it is common to restrict attention to certain classes of graphs and approximate the posterior distribution by repeatedly moving from one graph to another, using MCMC or methods…
The Brownian Web (BW) is the random network formally consisting of the paths of coalescing one-dimensional Brownian motions starting from every space-time point in ${\mathbb R}\times{\mathbb R}$. We extend the earlier work of Arratia and of…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
Phylogenetic networks generalise phylogenetic trees and allow for the accurate representation of the evolutionary history of a set of present-day species whose past includes reticulate events such as hybridisation and lateral gene transfer.…
We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman's random interlacement…
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$.…
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…
Climate change is reshaping species interactions and movement across fragmented landscapes. Despite this, most mathematical models assume random diffusion, overlooking the influence of directed movement. Here, we develop a graph based…
Inspired by a recent work of Crovisier and Pujals on mildly dissipative diffeomorphisms of the plane, we show that H\'enon-like and Lozi-like maps on their strange attractors are conjugate to natural extensions (a.k.a. shift homeomorphisms…
The Directed Landscape, a random directed metric on the plane (where the first and the second coordinates are termed spatial and temporal respectively), was constructed in the breakthrough work of Dauvergne, Ortmann, and Vir\'ag, and has…
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades, since it can be used to compute the rooted Subtree…
Deep neural networks (DNNs) and decision trees (DTs) are both state-of-the-art classifiers. DNNs perform well due to their representational learning capabilities, while DTs are computationally efficient as they perform inference along one…
We study percolation of two-sided level sets for the discrete Gaussian free field (DGFF) in 2D. For a DGFF $\varphi$ defined in a box $B_N$ with side length $N$, for $C$ large enough, there exist low crossings in the set of vertices $z$…
We prove that every component of the wired uniform spanning forest (WUSF) is one-ended almost surely in every transient reversible random graph, removing the bounded degree hypothesis required by earlier results. We deduce that every…
Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. For a graph $F=(V,E)$ and a set $S\subseteq V(F)$ of at least…
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalization of Schnyder woods to $d$-angulations (plane graphs with…
Suppose we concatenate two directed graphs, each isomorphic to a $d$ dimensional butterfly (but not necessarily identical to each other). Select any set of $2^k$ input and $2^k$ output nodes on the resulting graph. Then there exist node…