Related papers: Exact solutions for mass-dependent irreversible ag…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
Over the past decade, a combinatorial framework for discrete, finite, and irreversibly aggregating systems has emerged. This work reviews its progress, practical applications, and limitations. We outline the approach's assumptions and…
We define and study one-dimensional model of irreversible aggregation of particles obeying a discrete-time kinetics which is a special limit of the generalized Totally Asymmetric Simple Exclusion Process (gTASEP) on open chains. The model…
We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a…
The adhesive dynamics of a one-dimensional aggregating gas of point particles is rigorously described. The infinite hierarchy of kinetic equations for the distributions of clusters of nearest neighbours is shown to be equivalent to a system…
The scaling theory of irreversible aggregation is discussed in some detail. First, we review the general theory in the simplest case of binary reactions. We then extend consideration to ternary reactions, multispecies aggregation,…
The aggregation of particles in the free molecular regime is determined approximately for situations with a high degree of translational energy equilibration. The mean particle sizes develop linearly in time. Scaling relations are used to…
We present a model of one-dimensional irreversible adsorption in which particles once adsorbed immediately shrink to a smaller size or expand to a larger size. Exact solutions for the fill factor and the particle number variance as a…
We analyze the clustering problem through a flexible probabilistic model that aims to identify an optimal partition on the sample X 1 , ..., X n. We perform exact clustering with high probability using a convex semidefinite estimator that…
We present in a detailed manner the scaling theory of irreversible aggregation characterized by the set of reaction rates $K(k,l)=1/k+1/l$, as well as a minor generalisation thereof. In this case, it is possible to evaluate the scaling…
The paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete, and the binary aggregation alone governs the time evolution of the systems. By considering the growth…
The kinetic equations describing irreversible aggregation and the scaling approach developed to describe them in the limit of large times and large sizes are tersely reviewed. Next, a system is considered in which aggregates can only react…
Irreversible aggregation processes involving reactive and frozen clusters are investigated using the rate equation approach. In aggregation events, two clusters join irreversibly to form a larger cluster, and additionally, reactive clusters…
Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In the latter scenario,…
The independence clustering problem is considered in the following formulation: given a set $S$ of random variables, it is required to find the finest partitioning $\{U_1,\dots,U_k\}$ of $S$ into clusters such that the clusters…
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…
We develop a unified approach to the problem of clustering in the three different fields of applications, as indicated in the title the paper. The approach is based on Khintchine's probabilistic method that grew out of the Darwin-Fawler…
We investigate irreversible aggregation in which monomer-monomer, monomer-cluster, and cluster-cluster reactions occur with constant but distinct rates K_{MM}, K_{MC}, and K_{CC}, respectively. The dynamics crucially depends on the ratio…
We consider the integrable family of symmetric boundary-driven interacting particle systems that arise from the non-compact XXX Heisenberg model in one dimension with open boundaries. In contrast to the well-known symmetric exclusion…
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph…