相关论文: Scaling behaviour of lattice animals at the upper …
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use…
We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter…
We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to…
Recent advances on the glass problem motivate reexamining classical models of percolation. Here, we consider the displacement of an ant in a labyrinth near the percolation threshold on cubic lattices both below and above the upper critical…
We describe a general strategy, PERM (Pruned-Enriched Rosenbluth Method), for sampling configurations from a given Gibbs-Boltzmann distribution. The method is not based on the Metropolis concept of establishing a Markov process whose…
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the…
In this review, we describe applications of the pruned-enriched Rosenbluth method (PERM), a sequential Monte Carlo algorithm with resampling, to various problems in polymer physics. PERM produces samples according to any given prescribed…
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretised according to the staggered lattice fermion formalism. $d=2$ is the critical dimension for the spatial search…
We present high statistics simulations of weighted lattice bond animals and lattice trees on the square lattice, with fugacities for each non-bonded contact and for each bond between two neighbouring monomers. The simulations are performed…
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals. The method may also be used to calculate associated properties such as moments or perimeter multiplicities of the clusters. The new scheme…
Two improved versions of the pruned-enriched-Rosenbluth method (PERM) are proposed and tested on simple models of lattice heteropolymers. Both are found to outperform not only the previous version of PERM, but also all other stochastic…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
An improved version of the pruned-enriched-Rosenbluth method (PERM) is proposed and tested on finding lowest energy states in simple models of lattice heteropolymers. It is found to outperform not only the previous version of PERM, but also…
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…
We propose a lattice model for Dirac fermions which allows us to break the degeneracy of the node structure. In the presence of a random gap we analyze the scaling behavior of the localization length as a function of the system width within…
We present Monte Carlo simulations of semidilute solutions of long self-attracting chain polymers near their Ising type critical point. The polymers are modeled as monodisperse self-avoiding walks on the simple cubic lattice with attraction…
Finite-size scaling above the upper critical dimension is a long-standing puzzle in the field of Statistical Physics. Even for pure systems various scaling theories have been suggested, partially corroborated by numerical simulations. In…
We simulate the spin-1/2 Ising model and the Blume-Capel model at various values of the parameter D on the simple cubic lattice. We perform a finite size scaling study of lattices of a linear size up to L=360 to obtain accurate estimates…
Logarithmic finite-size scaling of the O($n$) universality class at the upper critical dimensionality ($d_c=4$) has a fundamental role in statistical and condensed-matter physics and important applications in various experimental systems.…
We present here the systematic development of quantitative lattice simulations of dense polymers through a novel computational technique that allows for an efficient accounting of the chain conformations. Our approach is based on the…