The Cosmic Graph: Optimal Information Extraction from Large-Scale Structure using Catalogues

T. Lucas Makinen, Tom Charnock, Pablo Lemos, Natàlia Porqueres, Alan Heavens, B. D. WandeltThe Open Journal of Astrophysics 2022

TL;DR

This paper introduces a novel approach to extract cosmological information from galaxy halo catalogs by representing them as graphs and using Information Maximizing Neural Networks (IMNNs). This "Cosmic Graph" method significantly outperforms traditional statistics, reducing parameter constraint areas by a factor of 42 and automatically combining mass and clustering information, even with noisy survey data.

What Problem Does This Paper Address?

Modern cosmology relies on analyzing the large-scale structure (LSS) of the universe to understand its fundamental parameters, like the matter density ($\Omega_m$) and the amplitude of density fluctuations ($\sigma_8$). Traditionally, this involves analyzing discrete catalogs of objects (like dark matter halos or galaxies) using summary statistics such as correlation functions. However, these methods often discard valuable information, especially in the highly non-Gaussian LSS. Field-level analyses, while more comprehensive, are computationally prohibitive. The challenge is to efficiently extract the maximum possible cosmological information from discrete, potentially noisy, and complex LSS data.

Methods

The core of this work is the combination of two powerful techniques:

  • Graph Representation: Large-scale structures are modeled as graphs. Dark matter halos become nodes, and connections between them (based on proximity) form edges. This allows for a natural representation of clustering and connectivity. Crucially, nodes can be "decorated" with additional information like halo mass or peculiar velocity.
  • Information Maximizing Neural Networks (IMNNs): IMNNs are neural networks trained to compress data into a minimal set of informative summaries. They are designed to maximize the Fisher information (a measure of how much information data contains about parameters) without needing an explicit likelihood function, relying instead on simulations.

The authors implement a Graph Neural Network (GNN) architecture within the IMNN framework. This "gIMNN" can process variable-length graph inputs and learn to extract cosmological information by updating node, edge, and global graph features through multiple layers. The network is trained to maximize the determinant of the Fisher information matrix, with regularization terms to ensure stable covariance.

Datasets

The primary dataset used is the Quijote simulation suite. This suite provides mock dark matter halo catalogs generated from cosmological simulations. The authors use these simulations to:

  • Generate halo catalogs with varying cosmological parameters ($\Omega_m$, $\sigma_8$).
  • Assemble these catalogs into graphs with different connectivity parameters (mass cuts and linking radii).
  • Train and validate the gIMNN models.

They also compare their results against the 2-point correlation function (2PCF), a standard cosmological statistic, computed from the same halo catalogs.

Key Insights and Ideas

  • Graphs as a Natural Language for LSS: The paper demonstrates that representing LSS as graphs provides a flexible and powerful framework that goes beyond traditional n-point statistics.
  • IMNNs for Implicit Likelihood Inference: IMNNs offer a way to extract cosmological information and perform inference even when the underlying data likelihood is unknown or intractable, relying solely on simulations.
  • Automatic Feature Combination: The gIMNNs automatically learn to combine information from different sources, such as halo clustering (graph structure) and halo mass (node decoration), without explicit programming.
  • Sensitivity to Graph Structure: The information extracted is highly sensitive to how the graph is constructed, particularly the connectivity (linking radius) and the inclusion of node features like mass.
  • Robustness to Noise: The gIMNN framework shows promise in handling noisy survey data, with only a moderate loss of information and potential for hardening the network through on-the-fly noise simulation.

Key Results

  • Significant Information Gain: The gIMNN approach reduces the area of joint $\Omega_m$, $\sigma_8$ parameter constraints by a factor of 42 compared to the 2-point correlation function when using small halo catalogs ($\sim$ 100 objects).
  • Mass Decoration Boosts Information: Decorating graph nodes with halo mass increases the extracted information by a factor of 2.3 over undecorated graphs.
  • Connectivity Matters: Increasing graph connectivity (larger linking radius) generally leads to higher information extraction, saturating at a level approximately 10-15 times higher than the 2PCF for sufficiently descriptive networks.
  • Noise Resilience: While increasing noise variance inflates parameter constraints, the gIMNN still extracts significant information and can be trained to be more robust to noise.
  • Simulation-Based Inference Ready: The learned gIMNN summaries are shown to be effective for simulation-based inference, capable of distinguishing between simulations generated at different cosmological parameters.

Limitations and Future Work

  • Fixed Number of Halos: The current study primarily uses small halo catalogs ($\sim$ 100 objects). The authors suggest that with larger catalogs, hierarchical clustering and information from smaller mass scales could be further exploited.
  • Parameter Space: The study focuses on two cosmological parameters ($\Omega_m$, $\sigma_8$). Future work could explore inference with a larger number of parameters.
  • Noise Model: The noise model used is a simplified on-the-fly addition of white noise to halo masses. More realistic noise models and survey cuts could be investigated.
  • Generalization: While the paper mentions network generalization to other data, further exploration is warranted.
  • Scalability: The authors suggest that hierarchical aggregation schemes could make the gIMNN scheme tractable for full-sized galaxy catalogs, which is a promising direction for future research.
  • Void Catalogues: The framework could be extended to analyze void catalogs, potentially providing complementary cosmological constraints.

Summary updated

Abstract

We present an implicit likelihood approach to quantifying cosmological information over discrete catalogue data, assembled as graphs. To do so, we explore cosmological parameter constraints using mock dark matter halo catalogues. We employ Information Maximising Neural Networks (IMNNs) to quantify Fisher information extraction as a function of graph representation. We a) demonstrate the high sensitivity of modular graph structure to the underlying cosmology in the noise-free limit, b) show that graph neural network summaries automatically combine mass and clustering information through comparisons to traditional statistics, c) demonstrate that networks can still extract information when catalogues are subject to noisy survey cuts, and d) illustrate how nonlinear IMNN summaries can be used as asymptotically optimal compressed statistics for Bayesian simulation-based inference. We reduce the area of joint $\Omega_m$, $\sigma_8$ parameter constraints with small ($\sim$ 100 object) halo catalogues by a factor of 42 over the two-point correlation function, and demonstrate that the networks automatically combine mass and clustering information. This work utilizes a new IMNN implementation over graph data in Jax, which can take advantage of either numerical or auto-differentiability. We also show that graph IMNNs successfully compress simulations away from the fiducial model at which the network is fitted, indicating a promising alternative to $n$-point statistics in catalogue simulation-based analyses. <em>Code and a tutorial for the analysis and relevant software can be found <a href="https://github.com/tlmakinen/cosmicGraphs"> here </a>. </em>
BibTeX
@article{makinen2022cosmic,
  author = {T. Lucas Makinen and Tom Charnock and Pablo Lemos and Natàlia Porqueres and Alan Heavens and B. D. Wandelt},
  title = {{The Cosmic Graph: Optimal Information Extraction from Large-Scale Structure using Catalogues}},
  journal = {The Open Journal of Astrophysics},
  year = {2022},
}
Figure