相关论文: Separating repeating fast radio bursts using the m…
An important task in the study of fast radio bursts (FRBs) remains the automatic classification of repeating and non-repeating sources based on their morphological properties. We propose a statistical model that considers a modified…
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. x The first work to succeed in computing a…
Fast radio bursts (FRBs) are millisecond-duration radio flashes of extragalactic origin, with magnetars implicated as viable central engines. Yet their triggering and radiation mechanisms remain unknown. Radio telescopes inevitably record…
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…
FRB 121102 is the only known repeating fast radio burst source. Here we analyze a wide-frequency-range (1-8 GHz) sample of high-signal-to-noise, coherently dedispersed bursts detected using the Arecibo and Green Bank telescopes. These…
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…
We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a…
We study the noise sensitivity of the minimum spanning tree (MST) of the $n$-vertex complete graph when edges are assigned independent random weights. It is known that when the graph distance is rescaled by $n^{1/3}$ and vertices are given…
In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for…
In this work, we introduce a quantitative methodology to define what is the main trunk and what are the significant branches of a minimum spanning tree (MST). We apply it to the pulsar tree, i.e. the MST of the pulsar population constructed…
We developed a source detection algorithm based on the Minimal Spanning Tree (MST), that is a graph-theoretical method useful for finding clusters in a given set of points. This algorithm is applied to gamma-ray bidimensional images where…
In the context of algorithm theory, various studies have been conducted on spanning trees with desirable properties. In this paper, we consider the \textsc{Minimum Cover Spanning Tree} problem (MCST for short). Given a graph $G$ and a…
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in $O(m\log\alpha(m,n))$ time, where $\alpha$ is the inverse-Ackermann function. This improves upon a long standing…
A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a system's components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment…
Fast radio bursts (FRBs) are millisecond-duration radio signals occurring at cosmological distances. However the physical model of FRBs is mystery, many models have been proposed. Here we study the frequency distributions of peak flux,…
This paper considers the \textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\log \log \log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this…
Since its initial discovery, the Fast radio burst (FRB) FRB 121102 has been found to be repeating with millisecond-duration pulses. Very recently, 15 new bursts were detected by the Green Bank Telescope (GBT) during its continous monitoring…
Some short gamma-ray bursts (SGRBs) are thought to be caused by the mergers of binary neutron stars which may sometimes produce massive neutron star remnants capable of producing extragalactic fast radio bursts (FRBs). We conducted a deep…
Maximum spanning tree (MST) is a popular tool in market network analysis. Large number of publications are devoted to the MST calculation and it's interpretation for particular stock markets. However, much less attention is payed in the…
We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the Congested Clique model. The input graph in the Congested Clique model is a graph of n nodes,…