Related papers: Computing 3 point correlation function randoms cou…
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these algorithms require reading the whole input graph. In many…
We study the possibility of using multilevel algorithms for the computation of correlation functions of gradient flow observables. For each point in the correlation function an approximate flow is defined which depends only on links in a…
We establish a practical method for the joint analysis of anisotropic galaxy two- and three-point correlation functions (2PCF and 3PCF) on the basis of the decomposition formalism of the 3PCF using tri-polar spherical harmonics. We perform…
In recent years, deep learning approaches have achieved state-of-the-art results in the analysis of point cloud data. In cosmology, galaxy redshift surveys resemble such a permutation invariant collection of positions in space. These…
Subspace clustering, the task of clustering high dimensional data when the data points come from a union of subspaces is one of the fundamental tasks in unsupervised machine learning. Most of the existing algorithms for this task require…
The definition and the properties of a Gaussian point distribution, in contrast to the well-known properties of a Gaussian random field are discussed. Constraints for the number density and the two-point correlation function arise. A simple…
We study two key issues militating against the use of the anisotropic three-point correlation function (3PCF) for cosmological parameter inference: difficulties with its computational estimation and high-dimensionality. We show how…
Galaxy cluster surveys offer great promise for measuring cosmological parameters, but survey analysis methods have not been widely studied. Using methods developed decades ago for galaxy clustering studies, it is shown that nearly exact…
We introduce a new method for estimating the covariance matrix for the galaxy correlation function in surveys of large-scale structure. Our method combines simple theoretical results with a realistic characterization of the survey to…
In this paper, I will introduce a fast and novel clustering algorithm based on Gaussian distribution and it can guarantee the separation of each cluster centroid as a given parameter, $d_s$. The worst run time complexity of this algorithm…
We present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity. The…
We introduce the basic techniques used for the analysis of three dimensional and two dimensional galaxy samples. We report the correlation analysis of various redshift surveys which shows that the available data are consistent with each…
We investigate the three-point functions of the weak lensing cosmic shear, using both analytic methods and numerical results from N-body simulations. The analytic model, an isolated dark matter halo with a powerlaw profile chosen to fit the…
Galaxy redshift surveys encode a wealth of information generated by nonlinear gravitational evolution, galaxy bias, and redshift-space distortions, only part of which is accessible through standard two-point statistics. Motivated by the…
It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…
Consensus clustering (or clustering aggregation) inputs $k$ partitions of a given ground set $V$, and seeks to create a single partition that minimizes disagreement with all input partitions. State-of-the-art algorithms for consensus…
Counting and finding triangles in graphs is often used in real-world analytics to characterize cohesiveness and identify communities in graphs. In this paper, we propose the novel concept of a cover-edge set that can be used to find…
The three-point current correlation function in Euclidean spacetime for a strongly coupled system with non-Abelian global symmetry, $\langle J^a_i(x)J^b_j(y)J^c_k(z)\rangle$, is calculated from the weakly coupled AdS dual. The contribution…
We describe an iterative algorithm to construct an unstructured tessellation of simplices (irregular tetrahedra in 3-dimensions) to approximate an arbitrary function to a desired precision by interpolation. The method is applied to the…
To complete a previous paper, the probability density functions of the center-of-gravity as positioning algorithm are derived with classical methods. These methods, as suggested by the textbook of Probability, require the preliminary…