Related papers: Minimal Spanning Tree graphs and power like scalin…
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…
The Angular Constrained Minimum Spanning Tree Problem ($\alpha$-MSTP) is defined in terms of a complete undirected graph $G=(V,E)$ and an angle $\alpha \in (0,2\pi]$. Vertices of $G$ define points in the Euclidean plane while edges, the…
We introduce a technique that is capable to filter out information from complex systems, by mapping them to networks, and extracting a subgraph with the strongest links. This idea is based on the Minimum Spanning Tree, and it can be applied…
We introduce and study the general problem of finding a most "scale-free-like" spanning tree of a connected graph. It is motivated by a particular problem in epidemiology, and may be useful in studies of various dynamical processes in…
This paper deals with the construction of a correlation decay tree (hypertree) for interacting systems modeled using graphs (hypergraphs) that can be used to compute the marginal probability of any vertex of interest. Local message passing…
Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…
We study the time dependence of maximal spanning trees and asset graphs based on correlation matrices of stock returns. In these networks the nodes represent companies and links are related to the correlation coefficients between them.…
We give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensional space, our algorithm computes a…
We study the crash dynamics of the Warsaw Stock Exchange (WSE) by using the Minimal Spanning Tree (MST) networks. We find the transition of the complex network during its evolution from a (hierarchical) power law MST network, representing…
We study the minimum spanning tree distribution on the space of spanning trees of the $n$-by-$n$ grid for large $n$. We establish bounds on the decay rates of the probability of the most and the least probable spanning trees as…
We present a systematic study of various statistical characteristics of high-frequency returns from the foreign exchange market. This study is based on six exchange rates forming two triangles: EUR-GBP-USD and GBP-CHF-JPY. It is shown that…
We consider two natural variants of the problem of minimum spanning tree (MST) of a graph in the parallel setting: MST verification (verifying if a given tree is an MST) and the sensitivity analysis of an MST (finding the lowest cost…
There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest and most frequently used draw random weights on the edges…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
The investigations of financial markets from a complex network perspective have unveiled many phenomenological properties, in which the majority of these studies map the financial markets into one complex network. In this work, we…
The cross-correlations between the exchange rate fluctuations of 74 currencies over the period 1995-2012 are analyzed in this paper. The eigenvalue distribution of the cross-correlation matrix exhibits a bulk which approximately matches the…
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle…
Minimum spanning trees (MSTs) are used in a variety of fields, from computer science to geography. Infectious disease researchers have used them to infer the transmission pathway of certain pathogens. However, these are often the MSTs of…