Related papers: Minimum spanning trees on random networks
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
In the length-constrained minimum spanning tree (MST) problem, we are given an $n$-node edge-weighted graph $G$ and a length constraint $h \geq 1$. Our goal is to find a spanning tree of $G$ whose diameter is at most $h$ with minimum…
There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…
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…
We introduce $\mathsf{WST}^{\beta_n}(K_n)$ as the weighted spanning tree of the complete graph $K_n$ w.r.t. the random electric network of conductances $\{\exp(-\beta_nU_{e})\}_{e\in E(K_n)}$ with $\mathrm{Unif}[0,1]$ i.i.d. $U_e$'s. Moving…
We study the spectral and diffusive properties of the wired minimal spanning forest (WMSF) on the Poisson-weighted infinite tree (PWIT). Let $M$ be the tree containing the root in the WMSF on the PWIT and $(Y_n)_{n\geq0}$ be a simple random…
Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We analyze a new general representation for the Minimum Weight Steiner Tree (MST) problem which translates the topological connectivity constraint into a set of local conditions which can be analyzed by the so called cavity equations…
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 the relation between the minimal spanning tree (MST) on many random points and the "near-minimal" tree which is optimal subject to the constraint that a proportion $\delta$ of its edges must be different from those of the MST.…
This paper studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible. Given an undirected labeled connected graph (i.e.,…
In recent years there has been a paradigm shift from the study of local task-related activation to the organization and functioning of large-scale functional and structural brain networks. However, a long-standing challenge in this…
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…
Consider a connected graph $G=(E,V)$ with $N=|V|$ vertices. The main purpose of this paper is to explore the question of uniform sampling of a subtree of $G$ with $n$ nodes, for some $n\leq N$ (the spanning tree case correspond to $n=N$,…
Stochastic networks based on random point sets as nodes have attracted considerable interest in many applications, particularly in communication networks, including wireless sensor networks, peer-to-peer networks and so on. The study of…
By the use of extensive numerical simulations we show that the nearest-neighbor energy level spacing distribution $P(s)$ and the entropic eigenfunction localization length of the adjacency matrices of Erd\H{o}s-R\'enyi (ER) {\it fully}…
This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
We study the construction of the minimum cost spanning geometric graph of a given rooted point set $P$ where each point of $P$ is connected to the root by a path that satisfies a given property. We focus on two properties, namely the…