Related papers: Geometric structure of percolation clusters
Road networks are characterised by several structural and geometric properties. Their topological structure determines partially its hierarchical arrangement, but since these are networks that are spatially situated and, therefore,…
The problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…
Cohesive particles form agglomerates that are usually very porous. Their geometry, particularly their fractal dimension, depends on the agglomeration process (diffusion-limited or ballistic growth by adding single particles or…
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…
We have examined extended structures, bridges and arches, in computer generated, non-sequentially stabilized, hard sphere deposits. The bridges and arches have well defined distributions of sizes and shapes. The distribution functions…
Using a recently developed algorithm for generic rigidity of two-dimensional graphs, we analyze rigidity and connectivity percolation transitions in two dimensions on lattices of linear size up to L=4096. We compare three different…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
How does the percolation transition behave in the absence of quenched randomness? To address this question, we study two nonrandom self-dual quasiperiodic models of square-lattice bond percolation. In both models, the critical point has…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
The internal organization of complex networks often has striking consequences on either their response to external perturbations or on their dynamical properties. In addition to small-world and scale-free properties, clustering is the most…
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…
The properties of polymer composites with nanofiller particles change drastically above a critical filler density known as the percolation threshold. Real nanofillers, such as graphene flakes and cellulose nanocrystals, are not idealized…
Series expansion methods are used to study directed bond percolation clusters on the square lattice whose lateral growth is restricted by a wall parallel to the growth direction. The percolation threshold $p_c$ is found to be the same as…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
We study a percolation model on the square lattice, where clusters "freeze" (stop growing) as soon as their volume (i.e. the number of sites they contain) gets larger than N, the parameter of the model. A model where clusters freeze when…
Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…
We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…