Related papers: Separating repeating fast radio bursts using the m…
Motivated by applications in clustering and synthetic data generation, we consider the problem of releasing a minimum spanning tree (MST) under edge-weight differential privacy constraints where a graph topology $G=(V,E)$ with $n$ vertices…
The statistical properties of energy and waiting time carry essential information about the source of repeating fast radio bursts (FRBs). In this paper, we investigate the randomness of energy and waiting time using four data samples from…
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.,…
Fast Radio Bursts (FRBs) are short-duration radio transients with mysterious origins. Since its uncertainty, there are very few FRBs that are observed by different instruments, simultaneously. This study presents a detailed analysis of a…
The repeating FRB 121102 (the "repeater") shows {repetitive bursting activities} and was localized in a host galaxy at $z=0.193$. On the other hand, despite dozens of hours of telescope time spent on follow-up observations, no other FRBs…
The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper,…
The minimum spanning tree (MST), a graph constructed from a distribution of points, draws lines between pairs of points so that all points are linked in a single skeletal structure that contains no loops and has minimal total edge length.…
Fast Radio Bursts (FRBs) are highly energetic radio transients with millisecond duration, whose physical origin is still unknown. Many models consider magnetars as possible FRB sources, supported by the observational association of FRBs…
Searching for fleeting radio transients like fast radio bursts (FRBs) with wide-field radio telescopes has become a common challenge in data-intensive science. Conventional algorithms normally cost enormous time to seek candidates by…
Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applications, network designers often seek to quickly find a…
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity…
We study the problem of detecting and recovering a planted spanning tree $M_n^*$ hidden within a complete, randomly weighted graph $G_n$. Specifically, each edge $e$ has a non-negative weight drawn independently from $P_n$ if $e \in M_n^*$…
We detail a new fast radio burst (FRB) survey with the Molonglo Radio Telescope, in which six FRBs were detected between June 2017 and December 2018. By using a real-time FRB detection system, we captured raw voltages for five of the six…
Fast radio bursts (FRBs) are radio signals that last milliseconds. They originate from cosmological distances and have relatively high dispersion measures (DMs), making them being excellent distance indicators. However, the origins of the…
Finding the minimum spanning tree (MST) of a graph is an important task in computer vision, as it enables a sparse and low-cost representation of connectivity among elements (such as superpixels, points, or regions), which is useful for…
This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities…
Recent observations of repeating fast radio bursts (FRBs) suggest that some FRBs reside in an environment consistent with that of binary neutron star (BNS) mergers. The bursting rate for repeaters could be very high and the emission site is…
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…
In the Steiner Tree problem we are given an edge weighted undirected graph $G = (V,E)$ and a set of terminals $R \subseteq V$. The task is to find a connected subgraph of $G$ containing $R$ and minimizing the sum of weights of its edges. We…
In length-constrained minimum spanning tree (MST) we are given an $n$-node graph $G = (V,E)$ with edge weights $w : E \to \mathbb{Z}_{\geq 0}$ and edge lengths $l: E \to \mathbb{Z}_{\geq 0}$ along with a root node $r \in V$ and a…