Related papers: A reverse Aldous/Broder algorithm

The $Aldous\text{-}Broder$ and $Wilson$ are two well-known algorithms to generate uniform spanning trees (USTs) based on random walks. This work studies their relationship while they construct random trees with the goal of reducing the…

Tree graphs are routinely used in statistics. When estimating a Bayesian model with a tree component, sampling the posterior remains a core difficulty. Existing Markov chain Monte Carlo methods tend to rely on local moves, often leading to…

Aldous-Broder algorithm is a famous algorithm used to sample a uniform spanning tree of any finite connected graph $G$, but it is more general: given an irreducible and reversible Markov chain $M$ on $G$ started at $r$, the tree rooted at…

In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…

In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…

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…

Let $\mathcal G$ be an infinite graph -- not necessarily one-ended -- on which the simple random walk is transient. We define a variant of the continuous-time random walk on $\mathcal G$ which reaches $\infty$ in finite time and "reflects…

D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…

Aldous' spectral gap conjecture asserts that on any graph the random walk process and the random transposition (or interchange) process have the same spectral gap. We prove the conjecture using a recursive strategy. The approach is a…

We present the first sublinear-in-$n$ round algorithm for sampling an approximately uniform spanning tree of an $n$-vertex graph in the CongestedClique model of distributed computing. In particular, our algorithm requires…

We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of…

The continuum random tree is the scaling limit of the uniform spanning tree on the complete graph with $N$ vertices. The Aldous-Broder chain on a graph $G=(V,E)$ is a discrete-time stochastic process with values in the space of rooted trees…

For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…

The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the…

Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this…

Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize…

We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$…

We give an $m^{1+o(1)}\beta^{o(1)}$-time algorithm for generating a uniformly random spanning tree in an undirected, weighted graph with max-to-min weight ratio $\beta$. We also give an $m^{1+o(1)}\epsilon^{-o(1)}$-time algorithm for…

The online semi-random graph process is a one-player game which starts with the empty graph on $n$ vertices. At every round, a player (called Builder) is presented with a vertex $v$ chosen uniformly at random and independently from previous…

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…