Related papers: Scalable Streaming Tools for Analyzing $N$-body Si…
The scientific community is presently witnessing an unprecedented growth in the quality and quantity of data sets coming from simulations and real-world experiments. To access effectively and extract the scientific content of such…
We describe a new method (\textsc{CompaSO}) for identifying groups of particles in cosmological $N$-body simulations. \textsc{CompaSO} builds upon existing spherical overdensity (SO) algorithms by taking into consideration the tidal radius…
We present a comparison of major methodologies of fast generating mock halo or galaxy catalogues. The comparison is done for two-point and the three-point clustering statistics. The reference catalogues are drawn from the BigMultiDark…
The increase in the observed volume in cosmological surveys imposes various challenges on simulation preparations. Firstly, the volume of the simulations required increases proportionally to the observations. However, large-volume…
Modeling large-scale sky survey observations is a key driver for the continuing development of high resolution, large-volume, cosmological simulations. We report the first results from the 'Q Continuum' cosmological N-body simulation run…
High-resolution cosmological N-body simulations are excellent tools for modelling the formation and clustering of dark matter haloes. These simulations suggest complex physical theories of halo formation governed by a set of effective…
Partitioning graphs into blocks of roughly equal size is widely used when processing large graphs. Currently there is a gap in the space of available partitioning algorithms. On the one hand, there are streaming algorithms that have been…
An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem. As a combinatorial problem, graph partition is NP-hard,…
We present analysis of the evolution of dark matter halos in dense environments of groups and clusters in dissipationless cosmological simulations. The premature destruction of halos in such environments, known as the overmerging, reduces…
We have developed a new halo finding method, Physically Self-Bound (PSB) group finding algorithm, which can efficiently identify halos located even at crowded regions. This method combines two physical criteria such as the tidal radius of a…
Piecewise Linear Approximation (PLA) is a well-established tool to reduce the size of the representation of time series by approximating the series by a sequence of line segments while keeping the error introduced by the approximation…
Accurate predictions of the abundance and clustering of dark matter haloes play a key role in testing the standard cosmological model. Here, we investigate the accuracy of one of the leading methods of connecting the simulated dark matter…
Mesoscopic simulations of hydrocarbon flow in source shales are challenging, in part due to the heterogeneous shale pores with sizes ranging from a few nanometers to a few micrometers. Additionally, the sub-continuum fluid-fluid and…
Resolving faint galaxies in large volumes is critical for accurate cosmic reionisation simulations. While less demanding than hydrodynamical simulations, semi-analytic reionisation models still require very large N-body simulations in order…
Fast N-body PM simulations with a small number of time steps such as FastPM or COLA have been remarkably successful in modeling the galaxy statistics, but their lack of small scale force resolution and long time steps cannot give accurate…
Rendering huge biological scenes with atomistic detail presents a significant challenge in molecular visualization due to the memory limitations inherent in traditional rendering approaches. In this paper, we propose a novel method for the…
Generating mocks for future sky surveys requires large volumes and high resolutions, which is computationally expensive even for fast simulations. In this work we try to develop numerical schemes to calibrate various halo and matter…
Understanding the physics of large cosmological surveys down to small (nonlinear) scales will significantly improve our knowledge of the Universe. Large N-body simulations have been built to obtain predictions in the non-linear regime.…
We introduce a novel algorithm to perform graph clustering in the edge streaming setting. In this model, the graph is presented as a sequence of edges that can be processed strictly once. Our streaming algorithm has an extremely low memory…
We present a detailed description and validation of our massively-parallel update to the mass-Peak Patch method, a fully predictive initial-space algorithm to quickly generate dark matter halo catalogues in very large cosmological volumes.…