Cosmological N‐Body Simulations

  title={Cosmological N‐Body Simulations},
  author={Edmund Bertschinger and James M. Gelb},
  journal={Computers in Physics},
A model for intergalactic filaments and galaxy formation during the first gigayear
We propose a physically based, analytic model for intergalactic filaments during the first gigayear of the universe. The structure of a filament is based upon a gravitationally bound, isothermal
Dark Matter And Cosmic Web Story
Prologue Classical Cosmological Paradigm Galactic Models and Dark Matter in the Solar Vicinity Global Dark Matter The Cosmic Web The Nature of Dark Matter The Structure of the Cosmic Web Cosmic
The persistent cosmic web and its filamentary structure I: Theory and implementation
The method is interesting as it allows for a robust quantification of the topological properties of a discrete distribution in terms of Betti numbers or Euler characteristics, without having to resort to smoothing or having to define a particular scale.
Statistics of Physical Properties of Dark Matter Clusters
We have identified over 2000 well-resolved cluster halos, and also their associated bound subhalos, from the output of a 10243 particle cosmological N-body simulation (of box size 320 h-1 Mpc and
Dependence of the inner dark matter profile on the halo mass
I compare the density profile of dark matter (DM) haloes in cold dark matter (CDM) N-body simulations with 1, 32, 256 and 1024 h - 1 Mpc box sizes. I compare the profiles when the most massive haloes
PHEW: a parallel segmentation algorithm for three-dimensional AMR datasets
We introduce phew (Parallel HiErarchical Watershed), a new segmentation algorithm to detect structures in astrophysical fluid simulations, and its implementation into the adaptive mesh refinement
The overdensity and masses of the friends-of-friends halos and universality of halo mass function
The friends-of-friends algorithm (hereafter FOF) is a percolation algorithm which is routinely used to identify dark matter halos from N-body simulations. We use results from percolation theory to
Fast identification of bound structures in large N-body simulations
An algorithm that is designed to allow the efficient identification and preliminary dynamical analysis of thousands of structures and substructures in large N-body simulations is presented, utilizing a refined density gradient system to identify the structures and an iterative approximate method to identify unbound particles, allowing fast calculation of bound substructure.
The evolution of substructure - I. A new identification method
We describe our new 'MLAPM halo finder' (MHF), which is based on the adaptive grid structure of the N-body code MLAPM. We then extend the MHF code in order to track the orbital evolution of
HOP: A New group finding algorithm for N body simulations
While the resulting algorithm has several user-chosen parameters, it is shown that the results are insensitive to most of these, the exception being the outer density cutoff of the groups.