1999
DOI: 10.1046/j.1365-8711.1999.02692.x
|View full text |Cite
|
Sign up to set email alerts
|

Large-scale bias and the peak background split

Abstract: Dark matter haloes are biased tracers of the underlying dark matter distribution. We use a simple model to provide a relation between the abundance of dark matter haloes and their spatial distribution on large scales. Our model shows that knowledge of the unconditional mass function alone is sufficient to provide an accurate estimate of the large-scale bias factor. We then use the mass function measured in numerical simulations of SCDM, OCDM and LambdaCDM to compute this bias. Comparison with these simulations… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

154
3,658
10
7

Year Published

2004
2004
2021
2021

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 2,646 publications
(3,829 citation statements)
references
References 24 publications
154
3,658
10
7
Order By: Relevance
“…Since the rapidly changing force field in dense regions will be mainly calculated as a tree correction, the PM part of the potential can be held fixed or extrapolated over the largest system time step. Since all near range forces are localized to particles in the algorithm only trees in the densest regions need to be updated at smaller fine-grained timesteps while remaining trees can be repaired using methods described by Springel et al (2001). Furthermore, the communication needs will be small at the fine-grained timesteps since forces are all determined locally and few particles will cross domain boundaries.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since the rapidly changing force field in dense regions will be mainly calculated as a tree correction, the PM part of the potential can be held fixed or extrapolated over the largest system time step. Since all near range forces are localized to particles in the algorithm only trees in the densest regions need to be updated at smaller fine-grained timesteps while remaining trees can be repaired using methods described by Springel et al (2001). Furthermore, the communication needs will be small at the fine-grained timesteps since forces are all determined locally and few particles will cross domain boundaries.…”
Section: Resultsmentioning
confidence: 99%
“…The boundaries of these domains are determined iteratively using the number of tree force interactions from the last step. It is a one-dimensional version of the orthogonal recursive bisection (ORB) domain decomposition method described in Dubinski (1996) and used in other parallel tree codes like GADGET (Springel et al 2001). At the end of this step, each processor contains a list of particles which requires the same amount of computation to determine tree force corrections.…”
Section: Slice Domain Decompositionmentioning
confidence: 99%
“…(Different halo mass definitions lead to different coefficients.) A similar functional form was justified on analytic grounds by Sheth and Tormen (1999), following a chain of argument that ultimately traces back to Press and Schechter (1974) and Bond et al (1991). Discussions of the halo population frequently refer to the characteristic mass scale M * , defined by σ(M * ) = δ c = 1.686,…”
Section: Cmb Anisotropies and Large Scale Structurementioning
confidence: 99%
“…where we use the Sheth & Tormen (1999) HMF and calibrate at z ∼ 5 using the Bouwens et al (2015b) LF. We calibrate over the halo mass range 10 7 − 10 14 M , and therefore extrapolate the LF over M uv = −7.5 to M uv = −24.5 to perform the abundance matching.…”
Section: Calibrationmentioning
confidence: 99%