arXiv subjects

Eduardo J. Barroso

Publications and source records attributed to Eduardo J. Barroso.

3 recordsLinked to original sources

arXiv2025

Weak lensing mass-richness relation of redMaPPer clusters in the LSST DESC DC2 simulations

Cluster scaling relations are key ingredients in cluster abundance-based cosmological studies. In optical cluster cosmology, where clusters are detected through their richness, cluster-weak gravitational lensing has proven to be a powerful tool to constrain the cluster mass-richness relation. This work is conducted as part of the Dark Energy Science Collaboration (DESC), which aims to analyze the Legacy Survey of Space and Time (LSST) of the Vera C. Rubin Observatory, starting in 2026. Weak lensing-inferred cluster properties, such as mass, suffer from several sources of bias. We constrain the mass-richness relation of 3,600 clusters detected by the redMaPPer algorithm in the cosmoDC2 extra-galactic mock catalog of the LSST DESC DC2 simulation, covering 440 square degrees, using number count measurements and either stacked weak lensing profiles or mean cluster masses in intervals of richness ($20 < λ< 200$) and redshift ($0.2 < z < 1$). We find that, for an LSST-like source galaxy density, our constraints are robust to changes in the concentration-mass relation and dark matter density profile modeling choices, when source redshifts and shapes are perfectly known. We find that photometric redshift uncertainties can introduce bias at the 1$σ$ level, which can be mitigated by an overall correction factor, fitted jointly with the scaling parameters. We find that including positive shear-richness covariance in the fit shifts the results by up to 0.5$σ$. Our constraints also compare fairly to a fiducial mass-richness relation, obtained from matching cosmoDC2 halo masses to redMaPPer-detected cluster richnesses.

astro-ph.CO↗

arXiv2024

AutoKnots: Adaptive Knot Allocation for Spline Interpolation

In astrophysical and cosmological analyses, the increasing quality and volume of astronomical data demand efficient and precise computational tools. This work introduces a novel adaptive algorithm for automatic knots (AutoKnots) allocation in spline interpolation, designed to meet user-defined precision requirements. Unlike traditional methods that rely on manually configured knot distributions with numerous parameters, the proposed technique automatically determines the optimal number and placement of knots based on interpolation error criteria. This simplifies configuration, often requiring only a single parameter. The algorithm progressively improves the interpolation by adaptively sampling the function-to-be-approximated, $f(x)$, in regions where the interpolation error exceeds the desired threshold. All function evaluations contribute directly to the final approximation, ensuring efficiency. While each resampling step involves recomputing the interpolation table, this process is highly optimized and usually computationally negligible compared to the cost of evaluating $f(x)$. We show the algorithm's efficacy through a series of precision tests on different functions. However, the study underscores the necessity for caution when dealing with certain function types, notably those featuring plateaus. To address this challenge, a heuristic enhancement is incorporated, improving accuracy in flat regions. This algorithm has been extensively used and tested over the years. NumCosmo includes a comprehensive set of unit tests that rigorously evaluate the algorithm both directly and indirectly, underscoring its robustness and reliability. As a practical application, we compute the surface mass density $Σ(R)$ and the average surface mass density $\overlineΣ(<R)$ for Navarro-Frenk-White and Hernquist halo density profiles, which provide analytical benchmarks. (abridged)

astro-ph.IM↗

arXiv2023

APES: Approximate Posterior Ensemble Sampler

This paper proposes a novel approach to generate samples from target distributions that are difficult to sample from using Markov Chain Monte Carlo (MCMC) methods. Traditional MCMC algorithms often face slow convergence due to the difficulty in finding proposals that suit the problem at hand. To address this issue, the paper introduces the Approximate Posterior Ensemble Sampler (APES) algorithm, which employs kernel density estimation and radial basis interpolation to create an adaptive proposal, leading to fast convergence of the chains. The APES algorithm's scalability to higher dimensions makes it a practical solution for complex problems. The proposed method generates an approximate posterior probability that closely approximates the desired distribution and is easy to sample from, resulting in smaller autocorrelation times and a higher probability of acceptance by the chain. We compare the performance of the APES algorithm with the affine invariance ensemble sampler with the stretch move in various contexts, demonstrating the efficiency of the proposed method. For instance, on the Rosenbrock function, the APES presented an autocorrelation time 140 times smaller than the affine invariance ensemble sampler. The comparison showcases the effectiveness of the APES algorithm in generating samples from challenging distributions. This paper presents a practical solution to generating samples from complex distributions while addressing the challenge of finding suitable proposals. With new cosmological surveys set to deal with many new systematics, this method offers a practical solution for the upcoming era of cosmological analyses. The algorithms presented in this paper are available at https://github.com/NumCosmo/NumCosmo.

astro-ph.CO↗