Classification algorithms applied to structure formation simulations

• URL: http://arxiv.org/abs/2106.06587v1
• Date: Fri, 11 Jun 2021 19:24:47 GMT
• Title: Classification algorithms applied to structure formation simulations
• Authors: Jazhiel Chac\'on, J. Alberto V\'azquez, Erick Almaraz
• Abstract summary: We use a random-forest classification algorithm to infer whether dark matter particles, traced back to the initial conditions, would end up in dark matter halos whose mass is above some threshold. Our results show that random forests are useful tools to predict the output of cosmological simulations without running the full process.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The properties of the matter density field present in the initial conditions of a cosmological simulation have an impact on the features of the structures formed after running the simulation. Based on this fact, in this paper we use a random-forest classification algorithm to infer whether or not dark matter particles, traced back to the initial conditions, would end up in dark matter halos whose mass is above some threshold. This problem might be posed as a binary classification task, where the initial conditions of the matter density field are mapped to classification labels provided by a halo finder program. Our results show that random forests are useful tools to predict the output of cosmological simulations without running the full process. These techniques might be used in the future to save computational costs and to explore more efficiently the effect of different dark matter/dark energy candidates on the formation of cosmological structures.

Related papers

• Predicting large scale cosmological structure evolution with GAN-based autoencoders [0.0]
  We make use of GAN-based Autoencoders (AEs) in an attempt to predict structure evolution within simulations. We find that while the AEs can predict structure evolution for 2D simulations of DM fields well, using only the density fields as input, they perform significantly more poorly in similar conditions for 3D simulations.
  arXiv  Detail & Related papers  (2024-03-04T16:17:43Z)
• Bayesian Simulation-based Inference for Cosmological Initial Conditions [5.954511401622426]
  We present a versatile Bayesian field reconstruction algorithm rooted in simulation-based inference and enhanced by autoregressive modeling. We show first promising results on a proof-of-concept application: the recovery of cosmological initial conditions from late-time density fields.
  arXiv  Detail & Related papers  (2023-10-30T18:24:25Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Aspects of scaling and scalability for flow-based sampling of lattice QCD [137.23107300589385]
  Recent applications of machine-learned normalizing flows to sampling in lattice field theory suggest that such methods may be able to mitigate critical slowing down and topological freezing. It remains to be determined whether they can be applied to state-of-the-art lattice quantum chromodynamics calculations.
  arXiv  Detail & Related papers  (2022-11-14T17:07:37Z)
• Isotropic Gaussian Processes on Finite Spaces of Graphs [71.26737403006778]
  We propose a principled way to define Gaussian process priors on various sets of unweighted graphs. We go further to consider sets of equivalence classes of unweighted graphs and define the appropriate versions of priors thereon. Inspired by applications in chemistry, we illustrate the proposed techniques on a real molecular property prediction task in the small data regime.
  arXiv  Detail & Related papers  (2022-11-03T10:18:17Z)
• A Greedy and Optimistic Approach to Clustering with a Specified Uncertainty of Covariates [6.231304401179968]
  We propose a greedy and optimistic clustering (GOC) algorithm that finds better feature candidates over empirical uncertainty sets. As an important application, we apply the GOC algorithm to synthetic datasets of the orbital properties of stars generated through our numerical simulation mimicking the formation process of the Milky Way.
  arXiv  Detail & Related papers  (2022-04-18T07:54:24Z)
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices [69.50862982117127]
  We benchmark the working conditions of the numerically analog simulator and find less demanding experimental setups. We also provide a deeper understanding of the errors of the simulation appearing due to discretization and finite size effects.
  arXiv  Detail & Related papers  (2020-11-28T11:23:06Z)
• Deep learning insights into cosmological structure formation [1.6351557933652356]
  We build a deep learning framework to investigate the role of anisotropic information in the initial conditions in establishing the final mass of dark matter halos. We find that anisotropies add a small, albeit statistically significant amount of information over that contained within spherical averages of the density field about final halo mass.
  arXiv  Detail & Related papers  (2020-11-20T19:00:00Z)
• Probability and consequences of living inside a computer simulation [77.65665055163332]
  It is shown that under reasonable assumptions a Drake-style equation can be obtained for the probability that our universe is the result of a deliberate simulation. We investigate the possibility of eavesdropping from the outside of such a simulation and introduce a general attack that can circumvent attempts at quantum cryptography inside the simulation.
  arXiv  Detail & Related papers  (2020-08-21T02:41:33Z)
• Hierarchical nucleation in deep neural networks [67.85373725288136]
  We study the evolution of the probability density of the ImageNet dataset across the hidden layers in some state-of-the-art DCNs. We find that the initial layers generate a unimodal probability density getting rid of any structure irrelevant for classification. In subsequent layers density peaks arise in a hierarchical fashion that mirrors the semantic hierarchy of the concepts.
  arXiv  Detail & Related papers  (2020-07-07T14:42:18Z)
• Emulation of cosmological mass maps with conditional generative adversarial networks [0.0]
  We propose a novel conditional GAN model that is able to generate mass maps for any pair of matter density $Omega_m$ and matter clustering strength $sigma_8$. Our results show that our conditional GAN can interpolate efficiently within the space of simulated cosmologies. This contribution is a step towards building emulators of mass maps directly, capturing both the cosmological signal and its variability.
  arXiv  Detail & Related papers  (2020-04-17T09:34:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.