اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBeyond two-point statistics: using the minimum spanning tree as a tool for cosmology
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Cosmological studies of large-scale structure have relied on two-point statistics, not fully exploiting the rich structure of the cosmic web. In this paper we show how to capture some of this cosmic web information by using the minimum spanning tree (MST), for the first time using it to estimate cosmological parameters in simulations. Discrete tracers of dark matter such as galaxies, $N$-body particles or haloes are used as nodes to construct a unique graph, the MST, that traces skeletal structure. We study the dependence of the MST on cosmological parameters using haloes from a suite of COLA simulations with a box size of $250 h^{-1}{rm Mpc}$, varying the amplitude of scalar fluctuations $left(A_{rm s}right)$, matter density $left(Omega_{rm m}right)$, and neutrino mass $left(sum m_{ u}right)$. The power spectrum $P$ and bispectrum $B$ are measured for wavenumbers between $0.125$ and $0.5$ $h{rm Mpc}^{-1}$, while a corresponding lower cut of $sim12.6$ $h^{-1}{rm Mpc}$ is applied to the MST. The constraints from the individual methods are fairly similar but when combined we see improved $1sigma$ constraints of $sim 17%$ ($sim 12%$) on $Omega_{rm m}$ and $sim 12%$ ($sim 10%$) on $A_{rm s}$ with respect to $P$ ($P+B$) thus showing the MST is providing additional information. The MST can be applied to current and future spectroscopic surveys (BOSS, DESI, Euclid, PSF, WFIRST, and 4MOST) in 3D and photometric surveys (DES and LSST) in tomographic shells to constrain parameters and/or test systematics.
قيم البحث
اقرأ أيضاً
The minimum spanning tree clustering algorithm is capable of detecting clusters with irregular boundaries. In this paper we propose two minimum spanning trees based clustering algorithm. The first algorithm produces k clusters with center and guarant
eed intra-cluster similarity. The radius and diameter of k clusters are computed to find the tightness of k clusters. The variance of the k clusters are also computed to find the compactness of the clusters. The second algorithm is proposed to create a dendrogram using the k clusters as objects with guaranteed inter-cluster similarity. The algorithm is also finds central cluster from the k number of clusters. The first algorithm uses divisive approach, where as the second algorithm uses agglomerative approach. In this paper we used both the approaches to find Informative Meta similarity clusters.
The aims are to investigate the clustering of the far-infrared sources from the Herschel infrared Galactic Plane Survey (Hi-GAL) in the Galactic longitude range of -71 to 67 deg. These clumps, and their spatial distribution, are an imprint of the ori
ginal conditions within a molecular cloud. This will produce a catalogue of over-densities. The minimum spanning tree (MST) method was used to identify the over-densities in two dimensions. The catalogue was further refined by folding in heliocentric distances, resulting in more reliable over-densities, which are cluster candidates. We found 1,633 over-densities with more than ten members. Of these, 496 are defined as cluster candidates because of the reliability of the distances, with a further 1,137 potential cluster candidates. The spatial distributions of the cluster candidates are different in the first and fourth quadrants, with all clusters following the spiral structure of the Milky Way. The cluster candidates are fractal. The clump mass functions of the clustered and isolated are statistically indistinguishable from each other and are consistent with Kroupas initial mass function.
Some beyond $Lambda$CDM cosmological models have dark-sector energy densities that suffer phase transitions. Fluctuations entering the horizon during such a transition can receive enhancements that ultimately show up as a distinctive bump in the powe
r spectrum relative to a model with no phase transition. In this work, we study the non-linear evolution of such signatures in the matter power spectrum and correlation function using N-body simulations, perturbation theory and HMcode - a halo-model based method. We focus on modelling the response, computed as the ratio of statistics between a model containing a bump and one without it, rather than in the statistics themselves. Instead of working with a specific theoretical model, we inject a parametric family of Gaussian bumps into otherwise standard $Lambda$CDM spectra. We find that even when the primordial bump is located at linear scales, non-linearities tend to produce a second bump at smaller scales. This effect is understood within the halo model due to a more efficient halo formation. In redshift space these nonlinear signatures are partially erased because of the damping along the line-of-sight direction produced by non-coherent motions of particles at small scales. In configuration space, the bump modulates the correlation function reflecting as oscillations in the response, as it is clear in linear Eulerian theory; however, they become damped because large scale coherent flows have some tendency to occupy regions more depleted of particles. This mechanism is explained within Lagrangian Perturbation Theory and well captured by our simulations.
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of all previo
usly known self-stabilizing asynchronous MST algorithms by a multiplicative factor $Theta(n)$, to the price of increasing the best known space complexity by a factor $O(log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only $O(log^2n)$ bits.
In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices differs from the
ir Euclidean distance. We show that given a set S of n points with integer coordinates in the plane and a rational dilation delta > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most delta exists.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
