Related papers: On the Cluster Size Distribution for Percolation o…
We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: First, we introduce the problem of correlation clustering…
We analyze subsamples of Abell and ACO cluster catalogs, in order to study the spatial properties of the large scale matter distribution. The subsamples analyzed are estimated to be nearly complete and are the standard ones used in the…
It is known that the number of points in the largest cluster of a percolating Poisson process restricted to a large finite box is asymptotically normal. In this note, we establish a rate of convergence for the statement. As each point in…
Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process…
For a random intersection graph with a power law degree sequence having a finite mean and an infinite variance we show that the global clustering coefficient admits a tunable asymptotic distribution.
The study of crossing probabilities - i.e. probabilities of existence of paths crossing rectangles - has been at the heart of the theory of two-dimensional percolation since its beginning. They may be used to prove a number of results on…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
The diffusion and coalescence of individual atoms on a nanostructured surface are treated in a purely statistical way. From this, analytical formulas are derived which, from a known initial state, give the final cluster size distribution on…
We say that a graph $G=(V,E)$ on $n$ vertices is a $\beta$-expander for some constant $\beta>0$ if every $U\subseteq V$ of cardinality $|U|\leq \frac{n}{2}$ satisfies $|N_G(U)|\geq \beta|U|$ where $N_G(U)$ denotes the neighborhood of $U$.…
We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…
Numerical simulations of Diffusion-Limited and Reaction-Limited Cluster-Cluster Aggregation processes of identical particles are performed in a two-dimensional box. It is shown that, for concentrations larger than a characteristic gel…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
We present exact and asymptotic results for clusters in the one-dimensional totally asymmetric exclusion process (TASEP) with two different dynamics. The expected length of the largest cluster is shown to diverge logarithmically with…
Clusters of infected individuals are defined on data from health laboratories, but this quantity has not been defined and characterized by epidemy models on statistical physics. For a system of mobile agents we simulate a model of infection…
We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…
The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…
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…
Cluster concepts have been extremely useful in elucidating many problems in physics. Percolation theory provides a generic framework to study the behavior of the cluster distribution. In most cases the theory predicts a geometrical…
We consider the Gaussian free field $\varphi$ on $\mathbb{Z}^d$, for $d\geq3$, and give sharp bounds on the probability that the radius of a finite cluster in the excursion set $\{\varphi \geq h\}$ exceeds a large value $N$, for any height…
We show that an intricate relation of cluster properties and optimal bipartitions, which takes place in undirected random graphs, extends to directed and mixed random graphs. In particular, the satisfability threshold coincides with the…