HOP: A Group-finding Algorithm for N-body Simulations

Discussion topics for individual codes
Post Reply
User avatar
Guardian of the Codes
Posts: 1116
Joined: Wed Aug 04, 2004 4:18 pm
Location: Washington, DC

HOP: A Group-finding Algorithm for N-body Simulations

Post by owlice » Tue Feb 15, 2011 3:47 pm

[c]HOP: A Group-finding Algorithm for N-body Simulations[/c][/b]
Abstract: 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 Nh 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.

Credit: Eisenstein, Daniel; Hut, Piet

Site: https://www.cfa.harvard.edu/~deisenst/hop/

Bibcode: 2011ascl.soft02019E

ID: ascl:1102.019
Last edited by Ada Coda on Fri Dec 08, 2017 5:58 am, edited 1 time in total.
Reason: Updated code entry.
Code-seeking owl at your service

Post Reply