arXiv subjects

Amit Reza

Publications and source records attributed to Amit Reza.

27 records · Page 2Linked to original sources

arXiv2021

Convolutional neural networks for the detection of the early inspiral of a gravitational-wave signal

GW170817 has led to the first example of multi-messenger astronomy with observations from gravitational wave interferometers and electromagnetic telescopes combined to characterise the source. However, detections of the early inspiral phase by the gravitational wave detectors would allow the observation of the earlier stages of the merger in the electromagnetic band, improving multi-messenger astronomy and giving access to new information. In this paper, we introduce a new machine-learning-based approach to produce early-warning alerts for an inspiraling binary neutron star system, based only on the early inspiral part of the signal. We give a proof of concept to show the possibility to use a combination of small convolutional neural networks trained on the whitened detector strain in the time domain to detect and classify early inspirals. Each of those is targeting a specific range of chirp masses dividing the binary neutron star category into three sub-classes: light, intermediate and heavy. In this work, we focus on one LIGO detector at design sensitivity and generate noise from the design power spectral density. We show that within this setup it is possible to produce an early alert up to 100 seconds before the merger for the best-case scenario. We also present some future upgrades that will enhance the detection capabilities of our convolutional neural networks. Finally, we also show that the current number of detections for a realistic binary neutron star population is comparable to that of matched filtering and that there is a high probability to detect GW170817- and GW190425-like events at design sensitivity.

gr-qc↗

arXiv2020

Automating the Inclusion of Subthreshold Signal-to-Noise Ratios for Rapid Gravitational-Wave Localization

The accurate localization of gravitational-wave (GW) events in low-latency is a crucial element in the search for further multimessenger signals from these cataclysmic events. The localization of these events in low-latency uses signal-to-noise ratio (SNR) time-series from matched-filtered searches which identify candidate events. Here we report on an improvement to the GstLAL-based inspiral pipeline, the low-latency pipeline that identified GW170817 and GW190425, which automates the use of SNRs from all detectors in the network in rapid localization of GW events. This improvement was incorporated into the detection pipeline prior to the recent third observing run of the Advanced LIGO and Advanced Virgo detector network. Previously for this pipeline, manual intervention was required to use SNRs from all detectors if a candidate GW event was below an SNR threshold for any detector in the network. The use of SNRs from subthreshold events can meaningfully decrease the area of the 90% confidence region estimated by rapid localization. To demonstrate this, we present a study of the simulated detections of $\mathcal{O}(2\times10^4)$ binary neutron stars using a network mirroring the second observational run of the Advanced LIGO and Virgo detectors. When incorporating subthreshold SNRs in rapid localization, we find that the fraction of events that can be localized down to $100~\mathrm{deg}^2$ or smaller increases by a factor 1.18.

astro-ph.IM↗

arXiv2020

An early warning system for electromagnetic follow-up of gravitational-wave events

Binary neutron stars (BNSs) will spend $\simeq 10$ -- 15 minutes in the band of Advanced LIGO and Virgo detectors at design sensitivity. Matched-filtering of gravitational-wave (GW) data could in principle accumulate enough signal-to-noise ratio (SNR) to identify a forthcoming event tens of seconds before the companions collide and merge. Here we report on the design and testing of an early warning gravitational-wave detection pipeline. Early warning alerts can be produced for sources that are at low enough redshift so that a large enough SNR accumulates $\sim 10 - 60\,\rm s$ before merger. We find that about 7% (respectively, 49%) of the total detectable BNS mergers will be detected $60\, \rm s$ ($10\, \rm s$) before the merger. About 2% of the total detectable BNS mergers will be detected before merger and localized to within $100\, \rm \text{deg}^2$ (90% credible interval). Coordinated observing by several wide-field telescopes could capture the event seconds before or after the merger. LIGO-Virgo detectors at design sensitivity could facilitate observing at least one event at the onset of merger.

astro-ph.HE↗

arXiv2020

Prediction of the disease controllability in a complex network using machine learning algorithms

The application of machine learning (ML) techniques span a vast spectrum ranging from speech, face and character recognition, medical diagnosis, anomaly detection in data to the general classification, prediction, and regression problems. In the present work, we solve the problem of predicting R_0 for disease spreading on complex networks using the regression-based state-of-art ML techniques. R_0 is a metric that determines whether the disease-free epidemic or an endemic state is asymptotically stable and hence indicates the controllability of the disease spread. We predict R_0 , based on training the ML models with structural properties of complex networks, irrespective of the network type. The prediction is possible because: (a) The structure of complex networks plays an essential role in the spreading processes on networks (b) The regression techniques such as Support Vector Regression and Artificial Neural Network Model can be very efficiently used for prediction problems, even for non-linear data. We obtained good accuracy in the prediction of R_0 for the simulated networks as well as real-world networks using these techniques. Moreover, the ML model training is a one-time investment cost in terms of training time and memory, and the trained model can be used for predicting R_0 on unseen/new examples of networks.

cs.SI↗

arXiv2019

Fast evaluation of multi-detector consistency for real-time gravitational wave searches

Gravitational waves searches for compact binary mergers with LIGO and Virgo are presently a two stage process. First, a gravitational wave signal is identified. Then, an exhaustive search over possible signal parameters is performed. It is critical that the identification stage is efficient in order to maximize the number of gravitational wave sources that are identified. Initial identification of gravitational wave signals with LIGO and Virgo happens in real-time which requires that less than one second of computational time must be used for each one second of gravitational wave data collected. In contrast, subsequent parameter estimation may require hundreds of hours of computational time to analyze the same one second of gravitational wave data. The real-time identification requirement necessitates efficient and often approximate methods for signal analysis. We describe one piece of real-time gravitational-wave identification: an efficient method for ascertaining a signal's consistency between multiple gravitational wave detectors suitable for real-time gravitational wave searches for compact binary mergers. This technique was used in analyses of Advanced LIGO's second observing run and Advanced Virgo's first observing run.

gr-qc↗

arXiv2019

Random projections in gravitational wave searches of compact binaries

Random projection (RP) is a powerful dimension reduction technique widely used in the analysis of high dimensional data. We demonstrate how this technique can be used to improve the computational efficiency of gravitational wave searches from compact binaries of neutron stars or black holes. Improvements in low-frequency response and bandwidth due to detector hardware upgrades pose a data analysis challenge in the advanced LIGO era as they result in increased redundancy in template databases and longer templates due to the higher number of signal cycles in-band. The RP-based methods presented here address both these issues within the same broad framework. We first use RP for an efficient, singular value decomposition inspired template matrix factorization and develop a geometric intuition for why this approach works. We then use RP to calculate approximate time-domain match correlations in a lower dimensional vector space. For searches over parameters corresponding to non-spinning binaries with a neutron star and a black hole, a combination of the two methods can reduce the total on-line computational cost by an order of magnitude over a nominal baseline. This can, in turn, help free-up computational resources needed to go beyond current spin-aligned searches to more complex ones involving generically spinning waveforms.

gr-qc↗

arXiv2019

A class of randomized Subset Selection Methods for large complex networks

Most of the real world complex networks such as the Internet, World Wide Web and collaboration networks are huge; and to infer their structure and dynamics one requires handling large connectivity (adjacency) matrices. Also, to find out the spectra of these networks, one needs to perform the EigenValue Decomposition(or Singular Value Decomposition for bipartite networks) of these large adjacency matrices or their Laplacian matrices. In the present work, we proposed randomized versions of the existing heuristics to infer the norm and the spectrum of the adjacency matrices. In an earlier work [1], we used Subset Selection (SS) procedure to obtain the critical network structure which is smaller in size and retains the properties of original networks in terms of its Principal Singular Vector and eigenvalue spectra. We now present a few randomized versions of SS (RSS) and their time and space complexity calculation on various benchmark and real-world networks. We find that the RSS based on using QR decomposition instead of SVD in deterministic SS is the fastest. We evaluate the correctness and the performance speed after running these randomized SS heuristics on test networks and comparing the results with deterministic counterpart reported earlier. We find the proposed methods can be used effectively in large and sparse networks; they can be extended to analyse important network structure in dynamically evolving networks owing to their reduced time complexity.

physics.data-an↗

arXiv2019

A subset selection based approach to finding important structure of complex networks

Most of the real world networks such as the internet network, collaboration networks, brain networks, citation networks, powerline and airline networks are very large and to study their structure, and dynamics one often requires working with large connectivity (adjacency) matrices. However, it is almost always true that a few or sometimes most of the nodes and their connections are not very crucial for network functioning or that the network is robust to a failure of certain nodes and their connections to the rest of the network. In the present work, we aim to extract the size reduced representation of complex networks such that new representation has the most relevant network nodes and connections and retains its spectral properties. To achieve this, we use the Subset Selection (SS) procedure. The SS method, in general, is used to retrieve maximum information from a matrix in terms of its most informative columns. The retrieved matrix, typically known as subset has columns of an original matrix that have the least linear dependency. We present the application of SS procedure to many adjacency matrices of real-world networks and model network types to extract their subset. The subset owing to its small size can play a crucial role in analyzing spectral properties of large complex networks where space and time complexity of analyzing full adjacency matrices are too expensive. The adjacency matrix constructed from the obtained subset has a smaller size and represents the most important network structure. We observed that the subset network which is almost half the size of the original network has better information flow efficiency than the original network.

physics.soc-ph↗

arXiv2017

Least square ellipsoid fitting using iterative orthogonal transformations

We describe a generalised method for ellipsoid fitting against a minimum set of data points. The proposed method is numerically stable and applies to a wide range of ellipsoidal shapes, including highly elongated and arbitrarily oriented ellipsoids. This new method also provides for the retrieval of rotational angle and length of semi-axes of the fitted ellipsoids accurately. We demonstrate the efficacy of this algorithm on simulated data sets and also indicate its potential use in gravitational wave data analysis.

cs.CV↗