Related papers: Nature of largest cluster size distribution at the…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
Consider critical bond percolation on a large 2n by 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n^2 \pi(n), where \pi(n) denotes the…
We study the bond percolation problem in random graphs of $N$ weighted vertices, where each vertex $i$ has a prescribed weight $P_i$ and an edge can connect vertices $i$ and $j$ with rate $P_iP_j$. The problem is solved by the $q\to 1$…
Long-range power-law correlated percolation is investigated using Monte Carlo simulations. We obtain several static and dynamic critical exponents as function of the Hurst exponent $H$ which characterizes the degree of spatial correlation…
We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo…
Probability density functions (PDF) of statistical distributions of cluster sizes N, where N is the number of particles in the cluster, often seem to have less freedom than expected from considering the number of degrees of freedom at the…
The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly-connected ``links'' and multiply-connected ``blobs.'' Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block…
We study the action and geometry of P-vortices, discriminating between the percolating and finite clusters. We also discuss the interrelation of the monopoles and P-vortices. To define P-vortices we use both the direct maximal center…
It has been shown that many complex networks shared distinctive features, which differ in many ways from the random and the regular networks. Although these features capture important characteristics of complex networks, their applicability…
The self averaging properties of conductance $g$ are explored in random resistor networks with a broad distribution of bond strengths $P(g)\simg^{\mu-1}$. Distributions of equivalent conductances are estimated numerically on hierarchical…
We define the $Q$-factor in the percolation problem as the quotient of the size of the largest cluster and the average size of all clusters. As the occupation probability $p$ is increased, the $Q$-factor for the system size $L$ grows…
Periodic orbits in chaotic systems form clusters, whose elements traverse approximately the same points of the phase space. The distribution of cluster sizes depends on the length n of orbits and the parameter p which controls closeness of…
We numerically investigate the heterogeneity in cluster sizes in the two-dimensional Ising model and verify its scaling form recently proposed in the context of percolation problems [Phys. Rev. E 84, 010101(R) (2011)]. The scaling exponents…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
We study numerically and by scaling arguments the probability P(M)dM that a given dangling end of the incipient percolation cluster has a mass between M and M + dM. We find by scaling arguments that P(M) decays with a power law,…
It was recently noticed that high-energy scattering processes in QCD have a stochastic nature. An event-by-event scattering amplitude is characterised by a saturation scale which is a random variable. The statistical ensemble of saturation…
In order to investigate the dependence on lattice size of several observables in percolation, the Hoshen-Kopelman algorithm was modified so that growing lattices could be simulated. By this way, when simulating a lattice of size L, lattices…
In this paper a relative number density parameter, called the neighborhood function, is introduced so that the crowded nature of the neighborhood of individual sources can be described. With this parameter one can determine the probability…
Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity…
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…