Related papers: Monte Carlo Renormalization Group for Entanglement…
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…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We propose a renormalization group treatment of stochastically growing networks. As an example, we study percolation on growing scale-free networks in the framework of a real-space renormalization group approach. As a result, we find that…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
We use the renormalization group theory to study the directed bond percolation (Gribov process) near its second-order phase transition between absorbing and active state. We present a numerical calculation of the renormalization group…
Criticality is traditionally regarded as an unstable, fine-tuned fixed point of the renormalization group. We introduce an iterative bicolored percolation process in two dimensions and show that it can both preserve criticality and…
Monte Carlo simulations and finite-size scaling analysis have been carried out to study the critical behavior in a two-dimensional system of particles with two bonding sites that, by decreasing temperature or increasing density, polymerize…
We propose a method to efficiently integrate truncated probability densities. The method uses Markov chain Monte Carlo method to sample from a probability density matching the function being integrated. The required normalisation or…
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…
Simulating percolation and critical phenomena of labelled species inside films composed of single-component linear homogeneous macromolecules using molecular Monte Carlo method in 3 dimensions, we study dependence of these conducting…
We perform simulations for long hard-sphere polymer chains using a recently developed binary-tree based Monte Carlo method. Systems in two to five dimensions with free and periodic boundary conditions and up to $10^7$ repeat units are…
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…
We present a technique that enables the evaluation of perturbative expansions based on one-loop-renormalized vertices up to large expansion orders. Specifically, we show how to compute large-order corrections to the random phase…
In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…
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…
We conducted Monte Carlo simulations to analyze the percolation transition of a non-symmetric loop model on a regular three-dimensional lattice. We calculated the critical exponents for the percolation transition of this model. The…
For certain hierarchical structures, one can study the percolation problem using the renormalization-group method in a very precise way. We show that the idea can be also applied to two-dimensional planar lattices by regarding them as…
We describe a method to compute renormalized coupling constants in a Monte Carlo renormalization group calculation. It can be used, e.g., for lattice spin or gauge models. The basic idea is to simulate a joint system of block spins and…
We combine histogram reweighting techniques with the two-lattice matching Monte Carlo renormalization group method to conduct computationally efficient calculations of critical exponents on systems with moderately small lattice sizes. The…
The pair contact process with diffusion is studied by means of multispin Monte Carlo simulations and density matrix renormalization group calculations. Effective critical exponents are found to behave nonmonotonically as functions of time…