Related papers: Geometric structure of percolation clusters
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…
Cohesive powders form agglomerates that can be very porous. Hence they are also very fragile. Consider a process of complete fragmentation on a characteristic length scale $\ell$, where the fragments are subsequently allowed to settle under…
Macroscopic properties of heterogeneous media are frequently modelled by regular lattice models, which are based on a relatively small basic cluster of lattice sites. Here, we extend one of such models to any cluster's size kxk. We also…
We consider the fractal dimensions d_k of the k-connected part of percolation clusters in two dimensions, generalizing the cluster (k=1) and backbone (k=2) dimensions. The codimensions X_k = 2-d_k describe the asymptotic decay of the…
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 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…
Complex networks characterized by global transport processes rely on the presence of directed paths from input to output nodes and edges, which organize in characteristic linked components. The analysis of such network-spanning structures…
We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…
The simplest transport problem, namely maxflow, is investigated on critical percolation clusters in two and three dimensions, using a combination of extremal statistics arguments and exact numerical computations, for power-law distributed…
We consider geometrical clusters (i.e. domains of parallel spins) in the square lattice random field Ising model by varying the strength of the Gaussian random field, $\Delta$. In agreement with the conclusion of previous investigation…
We show that only considering the largest cluster suffices to obtain a first-order percolation transition. As opposed to previous realizations of explosive percolation our models obtain Gaussian cluster distributions and compact clusters as…
Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…
The percolation transitions on hyperbolic lattices are investigated numerically using finite-size scaling methods. The existence of two distinct percolation thresholds is verified. At the lower threshold, an unbounded cluster appears and…
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…
The Gaussian model of discontinuous percolation, recently introduced by Ara\'ujo and Herrmann [Phys. Rev. Lett., 105, 035701 (2010)], is numerically investigated in three dimensions, disclosing a discontinuous transition. For the…
We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…
Two distinct distribution functions $P_{sp}(m)$ and $P_{ns}(m)$ of the scaled largest cluster sizes $m$ are obtained at the percolation threshold by numerical simulations, depending on the condition whether the lattice is actually spanned…