Related papers: Universal cluster size distribution in a system of…
Consider unsupervised clustering of objects drawn from a discrete set, through the use of human intelligence available in crowdsourcing platforms. This paper defines and studies the problem of universal clustering using responses of crowd…
I review our current knowledge of the mass distribution in clusters, as obtained from the analysis of the projected phase-space distribution of cluster galaxies. I discuss the methods of analysis, their relative advantages and…
A simple three-dimensional model of a fluid whose constituent particles interact via a short range attractive and long range repulsive potential is used to model the aggregation into large spherical-like clusters made up of hundreds of…
Nucleation and growth is studied in a system undergoing diffusion-controlled condensation under gradual changes in parameters, such as cooling. It is demonstrated that when Gibbs-Thompson effect becomes negligible, the system falls into a…
We report on the construction of a granular network of particles to study the formation, evolution and statistical properties of clusters of particles developing at the vicinity of a liquid-solid-like phase transition within a vertically…
We propose a simple, projection-based algorithm for clustering mixtures of discrete (Bernoulli) distributions. Unlike previous approaches that rely on coordinate-specific ``combinatorial projections,'' our algorithm is rotationally…
We use a measure of clustering derived from the nearest neighbour distribution and the void probability function to distinguish between regular and clustered structures. This measure offers a succinct way to incorporate additional…
The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…
We study the probability distribution function of the long-time values of observables being time-evolved by Hamiltonians modeling clean and disordered one-dimensional chains of many spin-1/2 particles. In particular, we analyze the return…
We introduce and study the universal norm distribution in this paper, which generalizes the concepts of universal ordinary distribution and the universal Euler system. We study the Anderson type resolution of the universal norm distribution…
Velocity dispersions have been employed as a method to measure masses of clusters. To complement this conventional method, we explore the possibility of constraining cluster masses from the stacked phase space distribution of galaxies at…
We have studied both clusters and bulk systems while investigating amorphous states. We have varied the nature of interaction amongst the particles of the system under consideration in order to reveal the possible presence of universality…
We consider an interacting particle system in continuous configuration space. The pair interaction has an attractive part. We show that, at low density, the system behaves approximately like an ideal mixture of clusters (droplets): we prove…
A computational theory for clustering and a semi-supervised clustering algorithm is presented. Clustering is defined to be the obtainment of groupings of data such that each group contains no anomalies with respect to a chosen grouping…
We study diffusion of particles in large-scale simulations of one-dimensional stochastic sandpiles, in both the restricted and unrestricted versions. The results indicate that the diffusion constant scales in the same manner as the activity…
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination…
Most convex and nonconvex clustering algorithms come with one crucial parameter: the $k$ in $k$-means. To this day, there is not one generally accepted way to accurately determine this parameter. Popular methods are simple yet theoretically…
The large-scale structure of the Universe is thought to evolve by a process of gravitational amplification from low-amplitude Gaussian noise generated in the early Universe. The later, non-linear stages of gravitation-induced clustering…
What does it mean for a clustering to be fair? One popular approach seeks to ensure that each cluster contains groups in (roughly) the same proportion in which they exist in the population. The normative principle at play is balance: any…
The Foldy-Lax equation is generalized for a medium which consists of particles with both electric and magnetic responses. The result is used to compute fields scattered from ensembles of particles. The computational complexity is reduced by…