Related papers: Cluster pinch-point densities in polygons
We study gravitational clustering of mass points in three dimensions with random initial positions and periodic boundary conditions (no expansion) by numerical simulations. Correlation properties are well defined in the system and a sort of…
The statistical analysis of cosmic large-scale structure is most often based on simple two-point summary statistics, like the power spectrum or the two-point correlation function of a sample of galaxies or other types of tracers. In…
This contribution is concerned with the effective viscosity problem, that is, the homogenization of the steady Stokes system with a random array of rigid particles, for which the main difficulty is the treatment of close particles. Standard…
The two most extended density-based approaches to clustering are surely mixture model clustering and modal clustering. In the mixture model approach, the density is represented as a mixture and clusters are associated to the different…
This paper is a study of some of the critical properties of a simple model for flux. The model is motivated by gauge theory and is equivalent to the Ising model in three dimensions. The phase with condensed flux is studied. This is the…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
We consider a sequence of Poisson cluster point processes on $\mathbb{R}^d$: at step $n\in\mathbb{N}_0$ of the construction, the cluster centers have intensity $c/(n+1)$ for some $c>0$, and each cluster consists of the particles of a…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
We study the percolation properties of the growing clusters model. In this model, a number of seeds placed on random locations on a lattice are allowed to grow with a constant velocity to form clusters. When two or more clusters eventually…
Through studying the critical phenomena in continuum-percolation of discs, we find a new approach to locate the critical point, i.e. using the inflection point of $P_\infty$ as an evaluation of the percolation threshold. The susceptibility,…
One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words, this equation means that for all values different from p_c of the parameter p the following holds: Either…
We are interested in phase transitions in certain percolation models on point processes and their dependence on clustering properties of the point processes. We show that point processes with smaller void probabilities and factorial moment…
Even though the abundance and evolution of clusters have been used to study the cosmological parameters including the properties of dark energy owing to their pure dependence on the geometry of the Universe and the power spectrum, it is…
In dense, static, polydisperse granular media under isotropic pressure, the probability density and the correlations of particle-wall contact forces are studied. Furthermore, the probability density functions of the populations of pressures…
We present structural properties of two-dimensional polymers as far as they can be described by percolation theory. The percolation threshold, critical exponents and fractal dimensions of clusters are determined by computer simulation and…
A theory is derived for the nonequilibrium probability currents of the capillary interaction which determines the pair correlation function near contact. This yields an analytic expression for the equation of state, P = P(N/V,T), of wet…
We study a percolation model with restrictions on the opening of sites on the square lattice. In this model, each site $s \in \mathbb{Z}^{2}$ starts closed and an attempt to open it occurs at time $t=t_s$, where $(t_s)_{s \in \mathbb{Z}^2}$…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
Clustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms for the relevant optimization problems such as $k$-center, $k$-median, and $k$-means. Such algorithms…
Rigidity Percolation is a crucial framework for describing rigidity transitions in amorphous systems. We present a new, efficient algorithm to study central-force Rigidity Percolation in two dimensions. This algorithm combines the Pebble…