Astronomy and Astrophysics – Astrophysics
Scientific paper
1997-12-16
Astrophys.J.498:137-142,1998
Astronomy and Astrophysics
Astrophysics
LaTeX, 18 pages, 7 Postscript figures included. ApJ, in press. Source code available from http://www.sns.ias.edu/~eisenste/hop
Scientific paper
10.1086/305535
We describe a new method (HOP) for identifying groups of particles in N-body simulations. Having assigned to every particle an estimate of its local density, we associate each particle with the densest of the N_hop particles nearest to it. Repeating this process allows us to trace a path, within the particle set itself, from each particle in the direction of increasing density. The path ends when it reaches a particle that is its own densest neighbor; all particles reaching the same such particle are identified as a group. Combined with an adaptive smoothing kernel for finding the densities, this method is spatially adaptive, coordinate-free, and numerically straight-forward. One can proceed to process the output by truncating groups at a particular density contour and combining groups that share a (possibly different) density contour. While the resulting algorithm has several user-chosen parameters, we show that the results are insensitive to most of these, the exception being the outer density cutoff of the groups.
Eisenstein Daniel J.
Hut Piet
No associations
LandOfFree
HOP: A New Group-Finding Algorithm for N-body Simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with HOP: A New Group-Finding Algorithm for N-body Simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and HOP: A New Group-Finding Algorithm for N-body Simulations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-156613