Fragmentation of percolation clusters at the percolation threshold
نویسندگان
چکیده
منابع مشابه
Swelling of percolation clusters
The swelling of percolation clusters as models for gelling branched polymers is analyzed by using a simple mean-field approach (for all dimensions) and a Monte-Carlo simulation (for d = 3, bond fluctuation method). The numerical swelling exponent ~' = 0.443 + 0.008 shows a significant deviation from the lattice animals solution ~' = 0.5, which is caused by the difference between quenched and an...
متن کاملBeyond blobs in percolation cluster structure: the distribution of 3-blocks at the percolation threshold.
The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly connected "links" and multiply connected "blobs." Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block is a graph that cannot be separated into disconnected subgraphs by cutting the graph at two or fewer vertices. Clusters, blobs, and 3-blocks are special cases o...
متن کاملIndistinguishability of Percolation Clusters
We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is equivalent to non-decay of connectivity (a.k.a. long-range order). We then derive applications concerning uniqueness in Kazhdan groups and in wreath products, a...
متن کاملRigid-floppy percolation threshold.
The mathematical limits for the percolation of rigid and floppy clusters throughout continuous networks are considered. Results are compared to the previous prediction of Thorpe based on the assumption that the threshold condition is the equality of degrees of freedom and the number of constraints. It is demonstrated that, in two-dimensional systems, the thresholds values predicted here and in ...
متن کاملExtremal optimization of graph partitioning at the percolation threshold
The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called extremal optimization (EO), is compared with simulated annealing (SA) in extensive numerical simulations. While generally a complex (NP-hard) problem, the optimization of the graph partitions is particularly difficult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 1992
ISSN: 0031-9007
DOI: 10.1103/physrevlett.68.2692