arXiv subjects

Sibo Wang

Publications and source records attributed to Sibo Wang.

76 records · Page 5Linked to original sources

arXiv2019

Fusing numerical relativity and deep learning to detect higher-order multipole waveforms from eccentric binary black hole mergers

We determine the mass-ratio, eccentricity and binary inclination angles that maximize the contribution of the higher-order waveform multipoles $(\ell, \, |m|)= \{(2,\,2),\, (2,\,1),\, (3,\,3),\, (3,\,2), \, (3,\,1),\, (4,\,4),\, (4,\,3),\, (4,\,2),\,(4,\,1)\}$ for the gravitational wave detection of eccentric binary black hole mergers. We carry out this study using numerical relativity waveforms that describe non-spinning black hole binaries with mass-ratios $1\leq q \leq 10$, and orbital eccentricities as high as $e_0=0.18$ fifteen cycles before merger. For stellar-mass, asymmetric mass-ratio, binary black hole mergers, and assuming LIGO's Zero Detuned High Power configuration, we find that in regions of parameter space where black hole mergers modeled with $\ell=|m|=2$ waveforms have vanishing signal-to-noise ratios, the inclusion of $(\ell, \, |m|)$ modes enables the observation of these sources with signal-to-noise ratios that range between 30\% to 45\% the signal-to-noise ratio of optimally oriented binary black hole mergers modeled with $\ell=|m|=2$ numerical relativity waveforms. Having determined the parameter space where $(\ell, \, |m|)$ modes are important for gravitational wave detection, we construct waveform signals that describe these astrophysically motivate scenarios, and demonstrate that these topologically complex signals can be detected and characterized in real LIGO noise with deep learning algorithms.

gr-qc↗

arXiv2019

Deep Learning at Scale for the Construction of Galaxy Catalogs in the Dark Energy Survey

The scale of ongoing and future electromagnetic surveys pose formidable challenges to classify astronomical objects. Pioneering efforts on this front include citizen science campaigns adopted by the Sloan Digital Sky Survey (SDSS). SDSS datasets have been recently used to train neural network models to classify galaxies in the Dark Energy Survey (DES) that overlap the footprint of both surveys. Herein, we demonstrate that knowledge from deep learning algorithms, pre-trained with real-object images, can be transferred to classify galaxies that overlap both SDSS and DES surveys, achieving state-of-the-art accuracy $\gtrsim99.6\%$. We demonstrate that this process can be completed within just eight minutes using distributed training. While this represents a significant step towards the classification of DES galaxies that overlap previous surveys, we need to initiate the characterization of unlabelled DES galaxies in new regions of parameter space. To accelerate this program, we use our neural network classifier to label over ten thousand unlabelled DES galaxies, which do not overlap previous surveys. Furthermore, we use our neural network model as a feature extractor for unsupervised clustering and find that unlabeled DES images can be grouped together in two distinct galaxy classes based on their morphology, which provides a heuristic check that the learning is successfully transferred to the classification of unlabelled DES images. We conclude by showing that these newly labeled datasets can be combined with unsupervised recursive training to create large-scale DES galaxy catalogs in preparation for the Large Synoptic Survey Telescope era.

astro-ph.IM↗

arXiv2019

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs

{\it SimRank} is a classic measure of the similarities of nodes in a graph. Given a node $u$ in graph $G =(V, E)$, a {\em single-source SimRank query} returns the SimRank similarities $s(u, v)$ between node $u$ and each node $v \in V$. This type of queries has numerous applications in web search and social networks analysis, such as link prediction, web mining, and spam detection. Existing methods for single-source SimRank queries, however, incur query cost at least linear to the number of nodes $n$, which renders them inapplicable for real-time and interactive analysis. { This paper proposes \prsim, an algorithm that exploits the structure of graphs to efficiently answer single-source SimRank queries. \prsim uses an index of size $O(m)$, where $m$ is the number of edges in the graph, and guarantees a query time that depends on the {\em reverse PageRank} distribution of the input graph. In particular, we prove that \prsim runs in sub-linear time if the degree distribution of the input graph follows the power-law distribution, a property possessed by many real-world graphs. Based on the theoretical analysis, we show that the empirical query time of all existing SimRank algorithms also depends on the reverse PageRank distribution of the graph.} Finally, we present the first experimental study that evaluates the absolute errors of various SimRank algorithms on large graphs, and we show that \prsim outperforms the state of the art in terms of query time, accuracy, index size, and scalability.

cs.DS↗

arXiv2013

Efficient Single-Source Shortest Path and Distance Queries on Large Graphs

This paper investigates two types of graph queries: {\em single source distance (SSD)} queries and {\em single source shortest path (SSSP)} queries. Given a node $v$ in a graph $G$, an SSD query from $v$ asks for the distance from $v$ to any other node in $G$, while an SSSP query retrieves the shortest path from $v$ to any other node. These two types of queries are fundamental building blocks of numerous graph algorithms, and they find important applications in graph analysis, especially in the computation of graph measures. Most of the existing solutions for SSD and SSSP queries, however, require that the input graph fits in the main memory, which renders them inapplicable for the massive disk-resident graphs commonly used in web and social applications. The only exceptions are a few techniques that are designed to be I/O efficient, but they all focus on undirected and/or unweighted graphs, and they only offer sub-optimal query efficiency. To address the deficiency of existing work, this paper presents {\em Highways-on-Disk (HoD)}, a disk-based index that supports both SSD and SSSP queries on directed and weighted graphs. The key idea of HoD is to augment the input graph with a set of auxiliary edges, and exploit them during query processing to reduce I/O and computation costs. We experimentally evaluate HoD on both directed and undirected real-world graphs with up to billions of nodes and edges, and we demonstrate that HoD significantly outperforms alternative solutions in terms of query efficiency.

cs.DB↗