Constructing Merger Trees of Density Peaks Using Phase-Space Watershed Segmentation Algorithm

Abstract

Structure identification in cosmological simulations plays an important role in analysing simulation outputs. The definition of these structures directly impacts the inferred properties derived from these simulations. This paper proposes a more straightforward definition and model of structure by focusing on density peaks rather than halos and clumps. It introduces a new watershed algorithm that uses phase-space analysis to identify structures, especially in complex environments where traditional methods may struggle due to spatially overlapping structures. Additionally, a merger tree code is introduced to track density peaks across timesteps, making use of the boosted potential for identifying the most bound particles for each peak.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…