This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Superclusters from velocity divergence fields

J. D. Peñaranda-Rivera 1, D. L. Paipa-León1, S. D. Hernández-Charpak1,2, J. E. Forero-Romero 1

1 Departamento de Física, Universidad de los Andes, Cra. 1 No. 18A-10 Edificio Ip, CP 111711, Bogotá, Colombia
2 Center for Neuroprosthetics and Brain Mind Institute, Swiss Federal Institute of Technology (EPFL), CH-1015, Lausanne, Switzerland
E-mail: [email protected]
(Accepted XXX. Received YYY; in original form ZZZ)
Abstract

Superclusters are a convenient way to partition and characterize the large scale structure of the Universe. In this Letter we explore the advantages of defining superclusters as watershed basins in the divergence velocity field. We apply this definition on diverse datasets generated from linear theory and N-body simulations, with different grid sizes, smoothing scales and types of tracers. From this framework emerges a linear scaling relation between the average supercluster size and the autocorrelation length in the divergence field, a result that holds for one order of magnitude from 10  Mpc h1h^{-1}up to 100  Mpc h1h^{-1}. These results suggest that the divergence-based definition provides a robust context to quantitatively compare results across different observational or computational frameworks. Through its connection with linear theory, it can also facilitate the exploration of how supercluster properties depend on cosmological parameters, paving the way to use superclusters as cosmological probes.

keywords:
cosmology: large-scale structure of Universe
pubyear: 2020pagerange: Superclusters from velocity divergence fieldsLABEL:lastpage

1 Introduction

Superclusters are the largest structures that can be discriminated on the large scale structure of the Universe. From the early studies (Oort, 1983) through the most recent efforts to define our home supercluster Laniakea (Tully et al., 2014) a great variety of superclusters definitions have been proposed and explored, mostly motivated by the improvements in observational techniques and advances in computational models.

Supercluster definitions span a broad conceptual range that includes: the manual segmentation of peculiar velocity fields (Tully et al., 2014), matter overdensity thresholds (Chon et al., 2015), percolation properties (Bagchi et al., 2017), thresholds on multi-scale density fields (Einasto et al., 2019; Einasto et al., 2020) and streamlines in the peculiar velocity data (Dupuy et al., 2019), among others. In general, all these definitions are different even if they operate on the same inputs. This means that the cross-algorithm comparison of supercluster properties, even as simple as their sizes, has to be done with caution.

A common feature in most of these studies is that the supercluster properties depend on the physical scale used to describe the underlying density or velocity fields. For instance, Dupuy et al. (2020) reported strong changes in the supercluster abundance as a function of the smoothing scale used to define the velocity field. Suhhonenko et al. (2011) also performed controled numerical experiments to measure how the cosmic web features, such as filaments, clusteras and voids, depend on the density perturbations at different scales.

Furthermore, the complexity in the algorithm used to actually find the superclusters in simulated or observed data also has an impact on the intepretation of the results. A large number of free parameters could produce a large variability on the detected superclusters and raise the question as to what are the optimal combination of parameters values to define the superclusters (Dupuy et al., 2020).

In this Letter we present a conceptual framework that allows us to reach a quantitative understanding of how the supercluster properties depend on the smoothing scale and develop a supercluster finding algorithm with low complexity. The supercluster definition is based on the velocity divergence field while the supercluster finding algorithm uses a watershed concept.

This Letter is structured as follows. In Section 2 we present our characterization of the velocity divergence field. Next, in Section 3, we describe the supercluster finding algorithm. In Section 4 we describe how we generate divergence fields on a grid to test our definitions and supercluster finding algorithm. In Section 5 we present our main results to finally conclude in Section 6 with future applications of the framework presented here.

2 autocorrelation length in the divergence field

We use the velocity divergence field, v\divergence\textbf{v}, as the main quantity to study over cosmological scales. From it we define a dimensionless divergence field, δ(r)\delta(\textbf{r}), as follows:

δ(r)1H0f𝐯,\delta(\textbf{r})\equiv-\frac{1}{H_{0}f}\divergence\bf{v}, (1)

where H0H_{0} is the Hubble parameter and ff is the growth rate of structure. This is a purely computational definition motivated by the linear theory of structure formation where the equality between the two sides of Equation (1) is expected to actually hold when δ(r)\delta(\textbf{r}) represents the matter overdensity.

We compute the power spectrum of this scalar field and denote it as Pδ(k)P_{\delta}(k). From this power spectrum we calculate the autocorrelation function as

ξδδ(r)=12π20k2Pδ(k)sinkrkr𝑑k.\xi_{\delta\delta}(r)=\frac{1}{2\pi^{2}}\int_{0}^{\infty}k^{2}P_{\delta}(k)\frac{\sin kr}{kr}dk. (2)

From the autocorrelation function we define the autocorrelation length, RδδR_{\delta\delta}, as the value of rr at which ξδδ(r)\xi_{\delta\delta}(r) drops by a factor of ten from the value it has for r0r\rightarrow 0. In practice, we compute the autocorrelation function in the interval 1Mpch1r100Mpch11\,{\rm Mpc}\,h^{-1}\leq r\leq 100\,{\rm Mpc}\,h^{-1} and RδδR_{\delta\delta} is defined by the value at which

ξδδ(Rδδ)=110ξδδ(1Mpch1).\xi_{\delta\delta}(R_{\delta\delta})=\frac{1}{10}\xi_{\delta\delta}(1\,{\rm Mpc}\,h^{-1}). (3)

We show in the following sections how by using this definition we obtain a linear relationship between the autocorrelation length, RδδR_{\delta\delta}, and the average supercluster size.

Field vmaxv_{max} LbL_{b} RsR_{s} NcN_{c}
type (km s-1) ( Mpc h1h^{-1}) ( Mpc h1h^{-1})
Gaussian - 720720 {22, 66, 1010, 1414, 2020} 360360
Gaussian - 300300 {33, 99, 1212, 1515, 1818} 100100
Gaussian - 10001000 {1010, 1515, 2020, 3030, 4040} 100100
N-body 150150 720720 {66, 1212, 3030, 4848, 6060} 120120
N-body 200200 720720 {55, 1010, 2020, 3030, 4040} 144144
N-body 300300 720720 {22, 66, 1010, 1414, 2020} 360360
Table 1: Summary of the 3030 different dimensionless divergence fields used in this Letter. The Field type describes whether the field comes from the Abacus Simulations (N-body) or it is generated from the power spectrum (Gaussian). vmaxv_{max} only applies to the N-body fields and refers to the minimum value of a halo maximum circular velocity to include it in the peculiar velocity field interpolation. LbL_{b} is the box size of the cubic volume used to compute the divergence. RsR_{s} lists the gaussian smoothing (in the case of N-body fields) and the wavelength 1/Rs1/R_{s} used to truncate the power spectrum (in the case of Gaussian fields). NcN_{c} is the number of grid voxels on a side of the interpolated density field.
Refer to caption
Figure 1: Slice across a 3D dimensionless divergence field (in colour) defined in Equation 1 together with the supercluster boundaries (in black) found by the watershed algorithm described in this Letter. The divergence field is a Gaussian field with a truncation scale of Rs=10R_{s}=10  Mpc h1h^{-1}, sampled over 3603360^{3} voxels on a cubic box of 720720  Mpc h1h^{-1} on a side.
Refer to caption
Refer to caption
Figure 2: Power spectrum (left) and autocorrelation function (right) for dimensionless divergence fields computed from linearly extrapolated power spectrum The size of the cubic box is Lb=1000L_{b}=1000  Mpc h1h^{-1}and the number of voxels is 1003100^{3}. Each line corresponds to a different truncation wavelength in the power spectrum of 1/Rs1/R_{s}.
Refer to caption
Refer to caption
Figure 3: Power spectrum (left) and autocorrelation function (right) for dimensionless divergence fields computed using velocity interpolation from N-body data. The size of the cubic box is Lb=720L_{b}=720  Mpc h1h^{-1}and the number of voxels is 3603360^{3}. Only dark matter haloes with maximum circular velocity larger than 300300  km s-1 were included in the velocity interpolation. Each line corresponds to a different Gaussian smoothing with length scale RsR_{s}.

3 Watershed Superclusters

We find the superclusters using a watershed algorithm (Beucher & Meyer, 1993) on the dimensionless divergence fields. The algorithm segments the whole volume by assigning each voxel to a unique supercluster.

Our implementation works as follows. We sweep the voxels in the dimensionless divergence grid from the highest values to the lowest, i.e. from the high density regions with converging flows to the lowest density regions with divergent flows. For the ii-th voxel under consideration we check whether its 26 neighbors have already been assigned to a group. If all the neighbors are unassigned, then this ii-th voxel starts a new group; if the majority of already assigned voxels belongs to the nn-th group, then this voxel belongs to that group. In case of a draw between groups, the voxel is assigned to the supercluster with the lowest nn value. At the end of the sweep all voxels have been assigned to a group. In all our calculations we take periodical boundary conditions into account.

Finally, each group found by the algorithm is interpreted as a supercluster with a volume, VsV_{s}, calculated by the total volume of the voxels belonging to it. From the volume VsV_{s} we compute the equivalent radius ReqR_{\rm eq}, that is the radius of the sphere with the same volume, Req=(34πVs)1/3R_{\rm eq}=\left(\frac{3}{4\pi}V_{s}\right)^{1/3}. We describe the supercluster population in a divergence field by the average value of the equivalent radius, Req\langle R_{\rm eq}\rangle.

Once the divergence field is provided, this algorithm does not have free parameters based either on divergence, density or distance thresholds. The algorithm has a single free parameter: the number of neighbors to make the search for assigned superclusters. In our case we use 2626, but our tests show that using lower values down to 66 neighbors do not impact the main scaling results reported in this Letter. A lower number of neighbors only results in a larger tail of small superclusters composed by a handful of voxels.

Figure 1 illustrates the results of the watershed algorithm. This shows how the typical supercluster size follows the typical size of the features in the divergence field.

4 Divergence Fields on a Grid

We use dimensionless divergence fields computed on a cubic grid. We generate them in two different ways. The first corresponds to Gaussian fields with a truncated power spectrum coming from linear theory. The second kind are fields generated by interpolation of biased tracers and smoothed with a Gaussian filter, with the tracers coming from N-body cosmological simulations. In both cases the cosmological parameters correspond to the Λ\LambdaCDM Planck 2015 cosmology (Planck Collaboration et al., 2016) with a Hubble parameter of H0=67.8H_{0}=67.8 km s-1 Mpc-1, a matter density parameter Ωm=0.308\Omega_{m}=0.308 and a spectral index ns=0.968n_{s}=0.968. We use a total of 3030 different divergence fields, summarized in Table 1, generated as follows.

4.1 Gaussian fields with truncated power Spectrum

We start by generating a density field with a power spectrum that follows no-wiggle parameterization of Eisenstein & Hu (1998). The power spectrum is extrapolated at z=0z=0 using linear theory and truncated at kmax=1/Rsk_{\rm max}=1/R_{s}. This procedure can be thought as erasing fluctuations smaller than RsR_{s}. This density field is generated over a cubic grid with Nc3N_{c}^{3} voxels over a cube of length LsL_{s} on a side. From this Gaussian density field we compute the overdensity and directly use it as the dimensionless divergence field. We generate 1515 different Gaussian fields by changing the values for LbL_{b}, NcN_{c} and RsR_{s}. Table 1 summarizes the different values for those parameters.

4.2 N-body fields from biased tracers with Gaussian smoothing

We use the public Friend-of-Friends catalogs at redshift z=0.1z=0.1 from the Abacus Project simulations (Garrison et al., 2018) to interpolate the haloes’ peculiar velocity over a grid with Ns3N_{s}^{3} voxels. The simulations were performed on a cube of side length 720720  Mpc h1h^{-1}with 144031440^{3} particles, corresponding to a DM particle mass resolution of 1×1010\sim 1\times 10^{10}  M . We start by selecting haloes with maximum circular velocity larger than vmaxv_{max}. Then we assign to each voxel the value of the average velocity of the haloes in that voxel, which is equivalent to a Nearest Grid Point interpolation scheme. If the voxel is empty we assign a value of 0 km s-1 . After this interpolation step we smooth the velocity field using a Gaussian filter of physical scale RsR_{s}. We generate 1515 different N-body based divergence fields by changing the values for vmaxv_{max}, NcN_{c} and RsR_{s}. Table 1 summarizes the different values for those parameters.

Refer to caption
Figure 4: Correlation length RδδR_{\delta\delta} as a function of the truncation scale RsR_{s}. Both for Gaussian and N-body fields the relationship between the two scales is close to linear below Rs=20R_{s}=20  Mpc h1h^{-1}.

5 Results

We start by quantifying the effect of the truncation/smoothing scale. Figure 2 and Figure 3 show the power spectrum and the corresponding autocorrelation function. In both cases, the right panel shows that the autocorrelation length increases with larger RsR_{s} values.

Figure 4 shows the relationship between the truncation/smoothing scale RsR_{s} and the autocorrelation length RδδR_{\delta\delta}. We find that below Rs<20R_{s}<20 Mpc h1h^{-1}the two scales almost follow a linear proportionality. Beyond that scale, the Gaussian fields continue that linearity up to Rδδ130R_{\delta\delta}\approx 130 Mpc h1h^{-1}, while the N-body fields saturates around Rδδ100R_{\delta\delta}\approx 100 Mpc h1h^{-1}.

Refer to caption
Figure 5: Average equivalent radius as a function of the autocorrelation length in their parent divergence field. The relationship between the two quantities is close to linear for autocorrelation lengths between 1010  Mpc h1h^{-1}and 100100  Mpc h1h^{-1}.
Refer to caption
Figure 6: Equivalent radius distributions from dimensionless divergence fields derived from a Gaussian random field and a N-body simulation. In both cases the average value for the equivalent radius is close to 8080 Mpc h1h^{-1}. The distributions shapes are different; the Gaussian field produces a narrower, closer to Gaussian, distribution than the N-body field.

Our most important result is summarized in Figure 5. The plot shows that the average supercluster size linearly follows the autocorrelation length as defined in Equation 3. The linear correlations holds both for Gaussian and N-body fields over one order of magnitude from 1010 Mpc h1h^{-1}up to 100100 Mpc h1h^{-1}. In other words, the autocorrelation formalism over the velocity divergence fields is able to estimate the typical supercluster size. We parameterize this strong linear dependence as Req=αRδδ\langle R_{\rm{eq}}\rangle=\alpha R_{\delta\delta}, the best fit gives α=1.38±0.03\alpha=1.38\pm 0.03 for Gaussian fields and α=0.93±0.01\alpha=0.93\pm 0.01 for N-body fields.

This linear scaling relation with α1\alpha\approx 1 depends on the constant used in the definition in Equation 3). Using values larger than 1/101/10 in that definition breaks the linear scaling above Rδδ40R_{\delta\delta}\approx 40 Mpc h1h^{-1}for N-body fields. Furthermore, the regions where the linear scaling still holds, show values of α\alpha smaller than unity. Using values smaller than 1/101/10 also breaks the linearity. It also has the inconvenient of probing scales where the autocorrelation function might oscillate, making ambiguous the autocorrelation length definition.

We finalize this Section by showing how the supercluster size distribution differs in Gaussian fields compared to the N-body fields. Figure 6 shows the probability density function for the equivalent radius distributions from two different divergence fields. We pick these two distributions because they have similar mean values of 7575 Mpc h1h^{-1} and 8181  Mpc h1h^{-1} for the Gaussian and N-body fields, respectively. However, the distribution in the N-body field is wider (standard deviation of 3434  Mpc h1h^{-1}) than it is for the Gaussian field (standard deviation of 1414  Mpc h1h^{-1}), meaning that there are more superclusters with extreme values, say above 100100 Mpc h1h^{-1}, in the non-linear divergence field than in the Gaussian field.

What do these results have to say about Laniakea? The horizontal stripe in Figure 5 shows recent estimates of Laniakea’s equivalent radius (Dupuy et al., 2019). If Laniakea is to be considered as an average supercluster, then our results predict that the autocorrelation length in the divergence fields from the Cosmicflows data should be on the order of 60  Mpc h1h^{-1} to 85  Mpc h1h^{-1}. Having a measurement of the autocorrelation length on the divergence field from Cosmicflows-2, would allow to quantify to what extent Laniakea is a typical supercluster in a cosmological context.

6 Conclusions

In this Letter we presented the peculiar velocity divergence field as a central element to define and understand superclusters. We computed its autocorrelation function to give a precise definition of an autocorrelation length. To define the superclusters we performed a watershed partition over the same velocity divergence field. We tested this picture using different velocity divergence fields (Gaussian fields and fields from N-body simulations) computed over different grid sizes, smoothing scales and types of dark matter halos as tracers.

We found a linear scaling relation between the average supercluster size and the autocorrelation length. This result holds for one order of magnitude from 1010 Mpc h1h^{-1}up to 100100 Mpc h1h^{-1}. Comparing the full size distribution in the Gaussian and N-body divergence fields, selected to have average supercluster size similar to Laniakea, we found that the distributions are narrower and more symmetric in the Gaussian field.

The concepts we have presented here are straightforward to apply both to observational data and simulations. For instance the velocity divergence field has already been used in CosmicFlows-2 reconstruction data to define cosmic web elements (Libeskind et al., 2015) and could thus be used to find superclusters and compute its autocorrelation length.

There are multiple directions that could be addressed in future work. For instance, measuring to what extent the linearity between scales in Figure 4 depends on the box size, comparing supercluster sizes from different definitions that take similar data as an input (Einasto et al., 2020), finding scaling relationships between sizes, 3D shapes, maximum divergence depth, and the dependence of supercluster properties on cosmological parameters together with its redshift evolution.

Finally, studying the link between divergence based superclusters, their density field (Einasto et al., 2020) and graph properties (García-Alvarado et al., 2020) computed on top of the galaxy spatial distribution could provide a potential way to define superclusters where velocity information is not available and also quantifying the relationship between large scale structure topology and dynamics.

Data Availability Statement

The N-body data used to build the interpolated divergence fields are available through https://lgarrison.github.io/AbacusCosmos/. The code to generate the gaussian random fields and find the superclusters is available at https://github.com/astroandes/WatershedDivergenceSuperclusters

References

  • Bagchi et al. (2017) Bagchi J., Sankhyayan S., Sarkar P., Raychaudhury S., Jacob J., Dabhade P., 2017, ApJ, 844, 25
  • Beucher & Meyer (1993) Beucher S., Meyer F., 1993, Mathematical morphology in image processing, 34, 433
  • Chon et al. (2015) Chon G., Böhringer H., Zaroubi S., 2015, A&A, 575, L14
  • Dupuy et al. (2019) Dupuy A., et al., 2019, MNRAS, 489, L1
  • Dupuy et al. (2020) Dupuy A., Courtois H. M., Libeskind N. I., Guinet D., 2020, MNRAS, 493, 3513
  • Einasto et al. (2019) Einasto J., Suhhonenko I., Liivamägi L. J., Einasto M., 2019, A&A, 623, A97
  • Einasto et al. (2020) Einasto M., et al., 2020, A&A, 641, A172
  • Eisenstein & Hu (1998) Eisenstein D. J., Hu W., 1998, ApJ, 496, 605
  • García-Alvarado et al. (2020) García-Alvarado M. V., Li X. D., Forero-Romero J. E., 2020, MNRAS, 498, L145
  • Garrison et al. (2018) Garrison L. H., Eisenstein D. J., Ferrer D., Tinker J. L., Pinto P. A., Weinberg D. H., 2018, ApJS, 236, 43
  • Libeskind et al. (2015) Libeskind N. I., Hoffman Y., Tully R. B., Courtois H. M., Pomarède D., Gottlöber S., Steinmetz M., 2015, MNRAS, 452, 1052
  • Oort (1983) Oort J. H., 1983, ARA&A, 21, 373
  • Planck Collaboration et al. (2016) Planck Collaboration et al., 2016, A&A, 594, A13
  • Suhhonenko et al. (2011) Suhhonenko I., et al., 2011, A&A, 531, A149
  • Tully et al. (2014) Tully R. B., Courtois H., Hoffman Y., Pomarède D., 2014, Nature, 513, 71