Related papers: Efficient Monte Carlo algorithm and high-precision…
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…
We present a Markov Chain Monte Carlo algorithm based on the Metropolis algorithm for simulation of the flow of two immiscible fluids in a porous medium under macroscopic steady-state conditions using a dynamical pore network model that…
A grand canonical Monte Carlo (MC) algorithm is presented for studying the lattice gas model (LGM) of multiple protein sequence alignment, which coherently combines long-range interactions and variable-length insertions. MC simulations are…
We introduce a bond percolation procedure on a $D$-dimensional lattice where two neighbouring sites are connected by $N$ channels, each operated by valves at both ends. Out of a total of $N$, randomly chosen $n$ valves are open at every…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…
We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic broadcast algorithm, where a query…
We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has the continuous…
We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…
The computational cost of a Monte Carlo algorithm can only be meaningfully discussed when taking into account the magnitude of the resulting statistical error. Aiming for a fixed error per particle, we study the scaling behavior of the…
In this article, we revisit random site and bond percolation in square lattice focusing primarily on the behavior of entropy and order parameter. In the case of traditional site percolation, we find that both the quantities are zero at…
We investigate the attractive Fermi polaron problem in two dimensions using non-perturbative Monte Carlo simulations. We introduce a new Monte Carlo algorithm called the impurity lattice Monte Carlo method. This algorithm samples the path…
Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to…
We present two Monte Carlo sampling algorithms for probabilistic inference that guarantee polynomial-time convergence for a larger class of network than current sampling algorithms provide. These new methods are variants of the known…
In a recent article, one of the authors used $c=0$ logarithmic conformal field theory to predict crossing-probability formulas for percolation clusters inside a hexagon with free boundary conditions. In this article, we verify these…
We investigate the effect of structural distortion on bond percolation in simple cubic and body-centered cubic lattices using extensive Monte Carlo simulations. Distortion is introduced through controlled random displacements of lattice…
We study the onset of the bootstrap percolation transition as a model of generalized dynamical arrest. We develop a new importance-sampling procedure in simulation, based on rare events around "holes", that enables us to access bootstrap…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
Droplet nucleation and evaporation are ubiquitous in nature and many technological applications, such as phase-change cooling and boiling heat transfer. So far, the description of these phenomena at the molecular scale has posed challenges…
A crossing probability for the critical four-state Potts model on an $L\times M$ rectangle on a square lattice is numerically studied. The crossing probability here denotes the probability that spin clusters cross from one side of the…
Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…