Related papers: Probability distribution and sizes of spanning clu…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
We describe a general approach of determining the distribution of spanning subgraphs in the random graph $\G(n,p)$. In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
An explosive percolation transition is the abrupt emergence of a giant cluster at a threshold caused by a suppression of the growth of large clusters. In this paper, we consider the information entropy of the cluster size distribution,…
The percolation of Potts spins with equal values in Potts model on graphs (networks) is considered. The general method for finding the Potts clusters size distributions is developed. It allows for full description of percolation transition…
In cluster tomography, we propose measuring the number of clusters $N$ intersected by a line segment of length $\ell$ across a finite sample. As expected, the leading order of $N(\ell)$ scales as $a\ell$, where $a$ depends on microscopic…
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…
Observed clusters should be modelled by considering the distribution function to be a random variable that quantifies the degree of excitation of the system's normal modes. A system of canonical coordinates for the space of DFs is…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
Crackling noise is a common feature in many systems that are pushed slowly, the most familiar instance of which is the sound made by a sheet of paper when crumpled. In percolation and regular aggregation clusters of any size merge until a…
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In…
We present a study of connectivity percolation in suspensions of hard spherocylinders by means of Monte Carlo simulation and connectedness percolation theory. We focus attention on polydispersity in the length, the diameter and the…
We investigate the maximal non-critical cluster in a big box in various percolation-type models. We investigate its typical size, and the fluctuations around this typical size. The limit law of these fluctuations are related to maxima of…
We study the scaling of the average cluster size and percolation strength of geometrical clusters for the two-dimensional Ising model. By means of Monte Carlo simulations and a finite-size scaling analysis we discuss the appearance of…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…
The general relationship between an arbitrary frequency distribution and the expectation value of the frequency distributions of its samples is esablished. A set of combinations of expectation values whose value does not in general depend…
We study the statistical properties of the SIR epidemics in heterogeneous networks, when an epidemic is defined as only those SIR propagations that reach or exceed a minimum size s_c. Using percolation theory to calculate the average…
We investigate a critical scaling law for the cluster heterogeneity $H$ in site and bond percolations in $d$-dimensional lattices with $d=2,...,6$. The cluster heterogeneity is defined as the number of distinct cluster sizes. As an…