skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: A joint ranking statistic for multi-messenger astronomical searches with gravitational waves
Abstract Joint ranking statistics are used to distinguish real from random coincidences, ideally considering whether shared parameters are consistent with each other as well as whether the individual candidates are distinguishable from noise. We expand on previous works to include additional shared parameters, we use galaxy catalogues as priors for sky localization and distance, and avoid some approximations previously used. We develop methods to calculate this statistic both in low-latency using HEALPix sky maps, as well as with posterior samples. We show that these changes lead to a factor of one to two orders of magnitude improvement for GW170817-GRB 170817A depending on the method used, placing this significant event further into the foreground. We also examined the more tenuous joint candidate GBM-GW150914, which was largely penalized by these methods. Finally, we performed a simplistic simulation that argues these changes could better help distinguish between real and random coincidences in searches, although more realistic simulations are needed to confirm this.  more » « less
Award ID(s):
1912649
PAR ID:
10356121
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Classical and Quantum Gravity
Volume:
39
Issue:
8
ISSN:
0264-9381
Page Range / eLocation ID:
085010
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Uncertainty in artificial intelligence)
    Conditional Mutual Information (CMI) is a measure of conditional dependence between random variables X and Y, given another random variable Z. It can be used to quantify conditional dependence among variables in many data-driven inference problems such as graphical models, causal learning, feature selection and time-series analysis. While k-nearest neighbor (kNN) based estimators as well as kernel-based methods have been widely used for CMI estimation, they suffer severely from the curse of dimensionality. In this paper, we leverage advances in classifiers and generative models to design methods for CMI estimation. Specifically, we introduce an estimator for KL-Divergence based on the likelihood ratio by training a classifier to distinguish the observed joint distribution from the product distribution. We then show how to construct several CMI estimators using this basic divergence estimator by drawing ideas from conditional generative models. We demonstrate that the estimates from our proposed approaches do not degrade in performance with increasing dimension and obtain significant improvement over the widely used KSG estimator. Finally, as an application of accurate CMI estimation, we use our best estimator for conditional independence testing and achieve superior performance than the state-of-the-art tester on both simulated and real data-sets. 
    more » « less
  2. ; (, Astronomy & Astrophysics)
    Context.Variability is a ubiquitous feature of active galactic nuclei (AGNs), and the characterisation of this variability is crucial to constraining its physical mechanism and proper applications in AGN studies. The advent of all-sky and high-cadence optical surveys allows more accurate measurements of AGN variability down to short timescales as well as direct comparisons with X-ray variability from the same sample of sources. Aims.We aim to analyse the optical power spectral density (PSD) of AGNs with measured X-ray PSDs. Methods.We used light curves from the All-Sky Automated Survey for SuperNovae (ASAS-SN) and the Transiting Exoplanet Survey Satellite (TESS) and used the Lomb-Scargle periodogram to obtain PSDs. The joint optical PSD is measured over up to six orders of magnitude in frequency space on timescales of minutes to a decade. We fitted either a damped random walk (DRW) or a broken power law (BPL) model to constrain the PSD model and break frequency. Results.We find a set of break frequencies (≲10−2day−1) from DRW and BPL fits that generally confirm previously reported correlations between break frequencies and the black hole mass. In addition, we find a second set of break frequencies at higher frequencies (> 10−2day−1). We observe a potential weak correlation between the high-frequency breaks with the X-ray break frequencies and the black hole mass. We further explored the dependence of the correlations on other AGN parameters, finding that adding X-ray, optical, or bolometric luminosity as the third correlation parameter can substantially improve the correlation significances. The newly identified high-frequency optical breaks can constrain different aspects of the physics of AGNs. 
    more » « less
  3. ; ; (, 2017 IEEE International Conference on Big Data (Big Data))
    Random graphs (or networks) have gained a significant increase of interest due to its popularity in modeling and simulating many complex real-world systems. Degree sequence is one of the most important aspects of these systems. Random graphs with a given degree sequence can capture many characteristics like dependent edges and non-binomial degree distribution that are absent in many classical random graph models such as the Erdöos-Rényi graph model. In addition, they have important applications in uniform sampling of random graphs, counting the number of graphs having the same degree sequence, as well as in string theory, random matrix theory, and matching theory. In this paper, we present an OpenMP-based shared-memory parallel algorithm for generating a random graph with a prescribed degree sequence, which achieves a speedup of 20.4 with 32 cores. We also present a comparative study of several structural properties of the random graphs generated by our algorithm with that of the real-world graphs and random graphs generated by other popular methods. One of the steps in our parallel algorithm requires checking the Erdöos-Gallai characterization, i.e., whether there exists a graph obeying the given degree sequence, in parallel. This paper presents a non-trivial parallel algorithm for checking the Erdöos-Gallai characterization, which achieves a speedup of 23 with 32 cores. 
    more » « less
  4. ; ; ; ; ; (, Software: Practice and Experience)
    Identifying anomalies, especially weak anomalies in constantly changing targets, is more difficult than in stable targets. In this article, we borrow the dynamics metrics and propose the concept of dynamics signature (DS) in multi-dimensional feature space to efficiently distinguish the abnormal event from the normal behaviors of a variable star. The corresponding dynamics criterion is proposed to check whether a star's current state is an anomaly. Based on the proposed concept of DS, we develop a highly optimized DS algorithm that can automatically detect anomalies from millions of stars' high cadence sky survey data in real-time. Microlensing, which is a typical anomaly in astronomical observation, is used to evaluate the proposed DS algorithm. Two datasets, parameterized sinusoidal dataset containing 262,440 light curves and real variable stars based dataset containing 462,996 light curves are used to evaluate the practical performance of the proposed DS algorithm. Experimental results show that our DS algorithm is highly accurate, sensitive to detecting weak microlensing events at very early stages, and fast enough to process 176,000 stars in less than 1 s on a commodity computer. 
    more » « less
  5. ; (, The Astrophysical Journal)
    Abstract Upcoming photometric surveys will discover tens of thousands of Type Ia supernovae (SNe Ia), vastly outpacing the capacity of our spectroscopic resources. In order to maximize the scientific return of these observations in the absence of spectroscopic information, we must accurately extract key parameters, such as SN redshifts, with photometric information alone. We present Photo-zSNthesis, a convolutional neural network-based method for predicting full redshift probability distributions from multi-band supernova lightcurves, tested on both simulated Sloan Digital Sky Survey (SDSS) and Vera C. Rubin Legacy Survey of Space and Time data as well as observed SDSS SNe. We show major improvements over predictions from existing methods on both simulations and real observations as well as minimal redshift-dependent bias, which is a challenge due to selection effects, e.g., Malmquist bias. Specifically, we show a 61× improvement in prediction bias 〈Δz〉 on PLAsTiCC simulations and 5× improvement on real SDSS data compared to results from a widely used photometric redshift estimator, LCFIT+Z. The PDFs produced by this method are well constrained and will maximize the cosmological constraining power of photometric SNe Ia samples. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email