相关论文: Percolation thresholds for discrete-continuous mod…
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
The study of percolation phenomena has various applications ranging from social networks or materials science to quantum information. The most common percolation models are bond- or site-percolation for which the Newman-Ziff algorithm…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, \textbf{87} 052107 (2013)],…
We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.
We propose very efficient algorithms for the bootstrap percolation and the diffusion percolation models by extending the Newman-Ziff algorithm of the classical percolation [M. E. J. Newman and R. M. Ziff, Phys. Rev. Lett. 85 (2000) 4104].…
Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…
Rigidity Percolation is a crucial framework for describing rigidity transitions in amorphous systems. We present a new, efficient algorithm to study central-force Rigidity Percolation in two dimensions. This algorithm combines the Pebble…
Percolation theory and the associated conductance networks have provided deep insights into the flow and transport properties of a vast number of heterogeneous materials and media. In practically all cases, however, the conductance of the…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We study the bootstrap and diffusion percolation models in the simple-cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices using the Newman-Ziff algorithm. The percolation threshold and critical exponents were…
Descriptors that characterize the geometry and topology of the pore space of porous media are intimately linked to their transport properties. We quantify such descriptors, including pore-size functions and the critical pore radius…
We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
We introduce a continuum percolation model defined on the points of a d-dimensional homogeneous Poisson process. Each Poisson point is connected to all points within its connection range, which depends on the distances to the other Poisson…
The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…