Related papers: Percolation in a Multifractal
Models of long range percolations on lattices and on hierarchical lattices are related through the use of three intermediate geometries: a 1-parameter deformation based on the power mean function, relating lattice percolation to a…
A macroscopic characterization of fractals showing up a structural transition from dense to multibranched growth is made using optical diffraction theory. Such fractals are generated via the numerical solution of the 2D Poisson and…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.
We present a study on connectivity percolation in suspensions of hard platelets by means of Monte Carlo simulation. We interpret our results using a contact-volume argument based on an effective single--particle cell model. It is commonly…
Covering a graph or a lattice with non-overlapping dimers is a problem that has received considerable interest in areas such as discrete mathematics, statistical physics, chemistry and materials science. Yet, the problem of percolation on…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
A 1/L-expansion for percolation problems is proposed, where L is the lattice finite length. The square lattice with 27 different sizes L = 18, 22 ... 1594 is considered. Certain spanning probabilities were determined by Monte Carlo…
An analysis of water clustering is used to study the quasi-2D percolation transition of water adsorbed at planar hydrophilic surfaces. Above the critical temperature of the layering transition (quasi-2D liquid-vapor phase transition of…
The distribution of masses of clusters smaller than the infinite cluster is evaluated at the percolation threshold. The clusters are ranked according to their masses and the distribution $P(M/L^D,r)$ of the scaled masses M for any rank r…
Order parameter fluctuations (the largest cluster size distribution) are studied within a three-dimensional bond percolation model on small lattices. Cumulant ratios measuring the fluctuations exhibit distinct features near the percolation…
There is evidence of a scale-invariant matter distribution up to scales over 10 Megaparsecs. We review scaling (fractal or multifractal) models of large scale structure and their observational evidence. We conclude that the dynamics of…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
The more exact upper estimate of the percolation threshold for the {\it site problem} on the quadratic lattice ${\Bbb Z}^2$ have been found on the basis of the cluster decomposition. It is done by the number estimate of cycles on ${\Bbb…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
We study packings of bidispersed spherical particles on a spherical surface. The presence of curvature necessitates defects even for monodispersed particles; bidispersity either leads to a more disordered packing for nearly equal radii, or…
We study multifractality in a broad class of disordered systems which includes, e.g., the diluted x-y model. Using renormalized field theory we analyze the scaling behavior of cumulant averaged dynamical variables (in case of the x-y model…
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…
We study a generalization of site percolation on a simple cubic lattice, where not only single sites are removed randomly, but also entire parallel columns of sites. We show that typical clusters near the percolation transition are very…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
In this article, we extend the idea of stochastic dyadic Cantor set to weighted planar stochastic lattice that leads to a stochastic porous lattice. The process starts with an initiator which we choose to be a square of unit area for…