Related papers: Exact solutions for mass-dependent irreversible ag…
When particles on a line collide, they may coalesce into one. Such systems arise in the voter model, where boundaries between opinion clusters perform coalescing random walks, and in reaction-diffusion theory, where diffusing particles…
We develop a general theory for estimating the probability that a galaxy cluster of a given shape exists. The theory is based on the observed result that the distribution of galaxies is very close to quasi-equilibrium, in both its linear…
The learning of mixture models can be viewed as a clustering problem. Indeed, given data samples independently generated from a mixture of distributions, we often would like to find the {\it correct target clustering} of the samples…
Kernel-based clustering algorithms have the ability to capture the non-linear structure in real world data. Among various kernel-based clustering algorithms, kernel k-means has gained popularity due to its simple iterative nature and ease…
One basic requirement of many studies is the necessity of classifying data. Clustering is a proposed method for summarizing networks. Clustering methods can be divided into two categories named model-based approaches and algorithmic…
In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global…
We consider a free fermion chain with uniform nearest-neighbor hopping and let it evolve from an arbitrary initial state with a fixed macroscopic number of particles. We then prove that, at a sufficiently large and typical time, the…
Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters $K$, we use three stages to find a clustering. The first stage uses a hybrid…
The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled state. Here we consider quantum computational tests of mixedness, and we derive an exact expression of the acceptance…
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…
An approach to gauge theory in the context of locally conformally flat space-time is described. It is discussed how there are a number of natural principal bundles associated with any given locally conformally flat space-time $X$. The…
A statistical description of heavy particles suspended in incompressible rough self-similar flows is developed. It is shown that, differently from smooth flows, particles do not form fractal clusters. They rather distribute inhomogeneously…
The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…
Traditional k-means clustering underperforms on non-convex shapes and requires the number of clusters k to be specified in advance. We propose a simple geometric enhancement: after standard k-means, each cluster center is assigned a radius…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
In this paper, we recall various features of non equilibrium granular systems. Clusters with specific properties are found depending on the packing density, going from loose (a granular gas) to sintered (though brittle) polycrystalline…
We study the large time behaviour of the mass (size) of particles described by the fragmentation equation with homogeneous breakup kernel. We give necessary and sufficient conditions for the convergence of solutions to the unique…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
We investigate the triggering of star formation and the formation of stellar clusters in molecular clouds that form as the ISM passes through spiral shocks. The spiral shock compresses gas into $\sim$100 pc long main star formation ridge,…
We derive, in order of magnitude, the observed astrophysical and cosmological scales in the Universe, from neutron stars to superclusters of galaxies, up to, asymptotically, the observed radius of the Universe. This result is obtained by…