Related papers: The Use of Minimal Spanning Trees in Particle Phys…
For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in $O(n\log n)$ time where…
We attempt to shed new light on the notion of 'tree-like' metric spaces by focusing on an approach that does not use the four-point condition. Our key question is: Given metric space $M$ on $n$ points, when does a fully labelled…
We present a new method to detect and quantify mass segregation in star clusters. It compares the minimum spanning tree (MST) of massive stars with that of random stars. If mass segregation is present, the MST length of the most massive…
Making use of the wealth of new observational data coming from the sky it is possible to constrain particle physics theories beyond the Standard Model. One way to do this is illustrated in this article: a subset of theories admits cosmic…
In addition to being a prime candidate for a fundamental unified theory of all interactions in nature, string theory provides a natural setting to understand gauge field theories. This is linked to the concept of "D-branes": extended,…
We introduce a new structure for a set of points in the plane and an angle $\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \alpha \le…
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus graphs, for which we…
Consider~\(n\) nodes~\(\{X_i\}_{1 \leq i \leq n}\) independently distributed in the unit square~\(S,\) each according to a distribution~\(f.\) Nodes~\(X_i\) and~\(X_j\) are joined by an edge if the Euclidean distance~\(d(X_i,X_j)\) is less…
Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree spanning trees, which have received significant attention. Let $P =…
In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we…
This paper makes two main contributions: The first is the construction of a near-minimum spanning tree with constant average distortion. The second is a general equivalence theorem relating two refined notions of distortion: scaling…
Consider~\(n\) nodes distributed independently across~\(N\) cities contained with the unit square~\(S\) according to a distribution~\(f.\) Each city is modelled as an~\(r_n \times r_n\) square contained within~\(S\) and~\(MSTC_n\) denotes…
The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between pairs of edges in the tree is minimized. We first show that most of the bounding…
In this thesis, we study a new disordered system called random spanning tree in random environment (RSTRE) across different families of graphs with varying disorder distributions. We examine several observables as functions of the disorder…
The origin of weakly bound objects like clusters and hypernuclei, observed in heavy-ion collisions, is of theoretical and experimental interest. It is in the focus of the experiments at RHIC and LHC since it is not evident how such weakly…
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update efficiently the minimum spanning…
In this lecture we will consider the minimum weight spanning tree (MST) problem, i.e., one of the simplest and most vital combinatorial optimization problems. We will discuss a particular greedy algorithm that allows to compute a MST for…
BRST-methods provide elegant and powerful tools for the construction and analysis of constrained systems, including models of particles, strings and fields. These lectures provide an elementary introduction to the ideas, illustrated with…
Scale transformations have played an extremely successful role in studies of cosmological large-scale structure by relating the non-linear spectrum of cosmological density fluctuations to the linear primordial power at longer wavelengths.…
Most of the existing clustering methods are based on a single granularity of information, such as the distance and density of each data. This most fine-grained based approach is usually inefficient and susceptible to noise. Therefore, we…