Related papers: Efficient Gravitational Wave Searches with Pulsar …

The standard Bayesian technique for searching pulsar timing data for gravitational wave (GW) bursts with memory (BWMs) using Markov Chain Monte Carlo (MCMC) sampling is very computationally expensive to perform. In this paper, we explain…

Pulsar timing arrays (PTAs) are essential tools for detecting the stochastic gravitational wave background (SGWB), but their analysis faces significant computational challenges. Traditional methods like Markov-chain Monte Carlo (MCMC)…

The coalescence of binary neutron stars are one of the main sources of gravitational waves for ground-based gravitational wave detectors. As Bayesian inference for binary neutron stars is computationally expensive, more efficient and faster…

Hamiltonian Monte Carlo (HMC) is a Markov chain algorithm for sampling from a high-dimensional distribution with density $e^{-f(x)}$, given access to the gradient of $f$. A particular case of interest is that of a $d$-dimensional Gaussian…

Pulsar timing arrays (PTAs) use an array of millisecond pulsars to search for gravitational waves in the nanohertz regime in pulse time of arrival data. This paper presents rigorous tests of PTA methods, examining their consistency across…

The sensitivity of ongoing searches for gravitational wave (GW) sources in the ultra-low frequency regime ($10^{-9}$ Hz to $10^{-7}$ Hz) using Pulsar Timing Arrays (PTAs) will continue to increase in the future as more well-timed pulsars…

Hamiltonian Monte Carlo (HMC) is an efficient Bayesian sampling method that can make distant proposals in the parameter space by simulating a Hamiltonian dynamical system. Despite its popularity in machine learning and data science, HMC is…

Long-term precise timing of Galactic millisecond pulsars holds great promise for measuring the long-period (months-to-years) astrophysical gravitational waves. Several gravitational-wave observational programs, called Pulsar Timing Arrays…

By regularly monitoring the most stable millisecond pulsars over many years, pulsar timing arrays (PTAs) are positioned to detect and study correlations in the timing behaviour of those pulsars. Gravitational waves (GWs) from supermassive…

The pulsar timing array community has recently reported the first evidence of a low-frequency stochastic gravitational wave background. With longer observational timespans we expect to be able to resolve individual gravitational wave…

Traditional Markov Chain Monte Carlo methods suffer from low acceptance rate, slow mixing and low efficiency in high dimensions. Hamiltonian Monte Carlo resolves this issue by avoiding the random walk. Hamiltonian Monte Carlo (HMC) is a…

The Hamiltonian Monte Carlo (HMC) sampling algorithm exploits Hamiltonian dynamics to construct efficient Markov Chain Monte Carlo (MCMC), which has become increasingly popular in machine learning and statistics. Since HMC uses the gradient…

Pulsar timing arrays (PTAs) perform Bayesian posterior inference with expensive MCMC methods. Given a dataset of ~10-100 pulsars and O(10^3) timing residuals each, producing a posterior distribution for the stochastic gravitational wave…

In the last decade, the use of an ensemble of radio pulsars to constrain the characteristic strain caused by a stochastic gravitational wave background has advanced the cause of detection of very low frequency gravitational waves…

It is computationally expensive to search the large parameter space associated with a gravitational wave signal of uncertain frequency, such as might be expected from the possible pulsar generated by SN1987A. To address this difficulty we…

We introduce a new Markov-Chain Monte Carlo (MCMC) approach designed for efficient sampling of highly correlated and multimodal posteriors. Parallel tempering, though effective, is a costly technique for sampling such posteriors. Our…

Observations of low-frequency gravitational waves will require the highest possible timing precision from an array of the most spin-stable pulsars. We can improve the sensitivity of a pulsar timing array (PTA) to different…

The Hamiltonian Monte Carlo (HMC) algorithm is a powerful Markov Chain Monte Carlo (MCMC) method that uses Hamiltonian dynamics to generate samples from a target distribution. To fully exploit its potential, we must understand how…

Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard…

In recent years, the Hamiltonian Monte Carlo (HMC) algorithm has been found to work more efficiently compared to other popular Markov Chain Monte Carlo (MCMC) methods (such as random walk Metropolis-Hastings) in generating samples from a…