Related papers: Geometric structure of percolation clusters
The main objective of this paper is to study the size of a typical cluster of bond percolation on each of the five Platonic solids: the tetrahedron, the cube, the octahedron, the dodecahedron and the icosahedron. Looking at the clusters…
We present a percolation model that is inspired by recent works on immiscible two-phase flow in a mixed-wet porous medium made of a mixture of grains with two different wettability properties. The percolation model is constructed on a dual…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show a critical percolation transition when a fraction of edges…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…
The question of how clustering (non-zero density of triangles) in networks affects their bond percolation threshold has important applications in a variety of disciplines. Recent advances in modelling highly-clustered networks are employed…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
The effect of geometry and morphology of superconducting structure on magnetic flux trapping is considered. It is found that the clusters of normal phase, which act as pinning centers, have significant fractal properties. The fractal…
We study long-range power-law correlated disorder on square and cubic lattices. In particular, we present high-precision results for the percolation thresholds and the fractal dimension of the largest clusters as function of the correlation…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…
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$…
We present high statistics simulations for 2-d percolation clusters in the "bus bar" geometry at the critical point, for site and for bond percolation. We measured their backbone sizes and electrical conductivities. For all sets of…
We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied,…
High-density (HD) percolation describes the percolation over specific $\kappa$ -clusters, which are the compact sets of sites each connected to $\kappa$ nearest filled sites at least. It takes place in the classical patterns of…
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
To establish the bond-site duality of explosive percolations in 2 dimension, the site and bond explosive percolation models are carefully defined on a square lattice. By studying the cluster distribution function and the behavior of the…