Related papers: Minimal spanning trees at the percolation threshol…
There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…
The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$. This problem, known to be NP-hard, has…
We introduce a decomposition method for the distributed calculation of exact Euclidean Minimum Spanning Trees in high dimensions (where sub-quadratic algorithms are not effective), or more generalized geometric-minimum spanning trees of…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical…
We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an…
We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the…
In this paper, we consider the minimum spanning tree problem (for short, MSTP) on an arbitrary set of $n$ points of $d$-dimensional space in $l_1$-norm. For this problem, for each fixed $d\geq 2$, there is a known algorithm of the…
This is a short (and somewhat informal) contribution to the proceedings of the XVIth International Congress on Mathematical Physics, Prague, 2009, written up by the second author. We describe how the recent proof of the existence and…
In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.
In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider…
Due to its broad applications in practice, the minimum spanning tree problem and its all kinds of variations have been studied extensively during the last decades, for which a host of efficient exact and heuristic algorithms have been…
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation…
We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo…
Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes with the minimum total weight. We find that the MST can be partitioned into two distinct components, having significantly…
The pattern of formation of resonant frequency clusters in idealized sympodial dichasium trees is revealed by numerical modeling and analysis. The larger cluster's cardinality correlates with that of a Small World Network, which share the…
Fractal structure of shortest paths depends strongly on interresidue interaction cutoff distance. The dimensionality of shortest paths is calculated as a function of interaction cutoff distance. Shortest paths are self similar with a…
Invasion bond percolation (IBP) is mapped exactly into Prim's algorithm for finding the shortest spanning tree of a weighted random graph. Exploring this mapping, which is valid for arbitrary dimensions and lattices, we introduce a new IBP…
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum…