Related papers: Geometric structure of percolation clusters
We apply percolation theory to a recently proposed measure of fragmentation $F$ for social networks. The measure $F$ is defined as the ratio between the number of pairs of nodes that are not connected in the fragmented network after…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
We prove the fractal crumpled structure of collapsed unknotted polymer ring. In this state the polymer chain forms a system of densely packed folds, mutually separated in all scales. The proof is based on the numerical and analytical…
The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…
We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold…
In this paper, we investigate the effect of local structures on network processes. We investigate a random graph model that incorporates local clique structures to deviate from the locally tree-like behavior of most standard random graph…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
Analytical approaches to model the structure of complex networks can be distinguished into two groups according to whether they consider an intensive (e.g., fixed degree sequence and random otherwise) or an extensive (e.g., adjacency…
We consider geometrical characteristics of monopole clusters of the lattice SU(2) gluodynamics. We argue that the polymer approach to the field theory is an adequate means to describe the monopole clusters. Both finite-size and the…
Clustering, or transitivity has been observed in real networks and its effects on their structure and function has been discussed extensively. The focus of these studies has been on clustering of single networks while the effect of…
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…
Recent developments in hydraulic fracturing (fracking) have enabled the recovery of large quantities of natural gas and oil from old, low permeability shales. These developments include a change from low-volume, high-viscosity fluid…
Dispersed colloidal particles within a suspension can aggregate and spontaneously self-organize into a robust, percolating structure known as a gel. These network-like structures are prevalent in nature and play a critical role in many…
In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one…
We consider directed percolation with an absorbing boundary in 1+1 and 2+1 dimensions. The distribution of cluster lifetimes and sizes depend on the boundary. The new scaling exponents can be related to the exponents characterizing standard…
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…
We consider the effects of spatial correlations in a two-dimensional site percolation model. By generalizing the Newman-Ziff Monte Carlo algorithm to include spatial correlations, percolation thresholds and fractal dimensions of percolation…
The no-enclave percolation (NEP) model introduced recently by Sheinman et al. can be mapped to a problem of holes within a standard percolation backbone, and numerical measurements of these holes gives the size-distribution exponent $\tau =…
In this study, we investigate bond percolation in networks that have the Poisson degree distribution and a nearest-neighbor degree-degree correlation. Previous numerical studies on percolation critical behaviors of degree-correlated…