Related papers: Decorrelating the errors of the galaxy correlation…
We study forecasts for the accuracy of the determination of cosmological parameters from future large scale photometric surveys obtained using the full shape of the 2-point galaxy angular correlation function. The effects of linear…
Focusing on the well motivated aperture mass statistics $\Map$, we study the possibility of constraining cosmological parameters using future space based SNAP class weak lensing missions. Using completely analytical results we construct the…
Scalable QR factorization algorithms for solving least squares and eigenvalue problems are critical given the increasing parallelism within modern machines. We introduce a more general parallelization of the CholeskyQR2 algorithm and show…
Accurate modelling of redshift-space distortions (RSD) is challenging in the non-linear regime for two-point statistics e.g. the two-point correlation function (2PCF). We take a different perspective to split the galaxy density field…
The anisotropic 2-point correlation function (2PCF) of galaxies measures pairwise clustering as a function of the pair separation's angle to the line of sight. The latter is often defined as either the angle bisector of the…
A novel adaptive Markov chain Monte Carlo algorithm is presented. The algorithm utilizes sparsity in the partial correlation structure of a density to efficiently estimate the covariance matrix through the Cholesky factor of the precision…
We investigate whether neighbor-density-weighted marked correlation functions (MCFs) can extract cosmological information beyond the standard redshift-space two-point correlation function (2PCF). Using the Kun suite of 129 $w_0w_a$CDM$+\sum…
Dense kernel matrices $\Theta \in \mathbb{R}^{N \times N}$ obtained from point evaluations of a covariance function $G$ at locations $\{ x_{i} \}_{1 \leq i \leq N} \subset \mathbb{R}^{d}$ arise in statistics, machine learning, and numerical…
Ongoing and upcoming wide-field surveys at different wavelengths will measure the distribution of galaxy clusters with unprecedented precision, demanding accurate models for the two-point correlation function (2PCF) covariance. In this…
Compressive covariance estimation has arisen as a class of techniques whose aim is to obtain second-order statistics of stochastic processes from compressive measurements. Recently, these methods have been used in various image processing…
Covariance matrices are important tools for obtaining reliable parameter constraints. Advancements in cosmological surveys lead to larger data vectors and, consequently, increasingly complex covariance matrices, whose number of elements…
Covariance estimation for high-dimensional datasets is a fundamental problem in modern day statistics with numerous applications. In these high dimensional datasets, the number of variables p is typically larger than the sample size n. A…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
A recent proposal relates two dimensional holographic conformal field theories deformed by the integrable $T\bar{T}$ flow to AdS$_3$ with a finite radial cutoff. We investigate this proposal by studying perturbative correlation functions on…
We present a comparison of Fisher matrix forecasts for cosmological probes with Monte Carlo Markov Chain (MCMC) posterior likelihood estimation methods. We analyse the performance of future Dark Energy Task Force (DETF) stage-III and stage-…
Data re-sampling methods such as the delete-one jackknife are a common tool for estimating the covariance of large scale structure probes. In this paper we investigate the concepts of internal covariance estimation in the context of cosmic…
Smoothness of the subdiagonals of the Cholesky factor of large covariance matrices is closely related to the degrees of nonstationarity of autoregressive models for time series and longitudinal data. Heuristically, one expects for a nearly…
We present methods for computing the generalized polar decomposition of a matrix based on the dynamically weighted Halley (DWH) iteration. This method is well established for computing the standard polar decomposition. A stable…
Large kernel systems are prone to be ill-conditioned. Pivoted Cholesky decomposition (PCD) render a stable and efficient solution to the systems without a perturbation of regularization. This paper proposes a new PCD algorithm by tuning…
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial…