Related papers: A new monte carlo algorithm for growing compact Se…
The pivot algorithm -- we also call it the pivot chain -- is an algorithm for approximately uniform sampling from $\Omega _{N},$ the set of $N$-step self-avoiding walks on $\mathbb{Z}^{d}$ ($N,$ $d\geq 1$). Based on this algorithm and the…
Practitioners of Markov chain Monte Carlo (MCMC) may hesitate to use random walk Metropolis-Hastings algorithms, especially variable-at-a-time algorithms with many parameters, because these algorithms require users to select values of…
We demonstrate that the recently proposed Interacting Growth Walk (cond-mat/0108097) does not have the contact-scaling behaviour of Self-Avoiding Walk (M. Baiesi, E. Orlandini and A. L. Stella, Phys. Rev. Lett. 87, 070602 (2001)) at finite…
The Cooperative Motion Algorithm is an efficient lattice method to simulate dense polymer systems and is often used with two different criteria to generate a Markov chain in the configuration space. While the first method is the…
We introduce a `virtual-move' Monte Carlo (VMMC) algorithm for systems of pairwise-interacting particles. This algorithm facilitates the simulation of particles possessing attractions of short range and arbitrary strength and geometry, an…
We investigate a lattice model of polymers where the nearest-neighbour monomer-monomer interaction strengths differ according to whether the local configurations have so-called ``hydrogen-like'' formations or not. If the interaction…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
The Metropolis-within-Gibbs (MwG) algorithm is a widely used Markov Chain Monte Carlo method for sampling from high-dimensional distributions when exact conditional sampling is intractable. We study MwG with Random Walk Metropolis (RWM)…
We use complete enumeration and Monte Carlo techniques to study two-dimensional self-avoiding polymer chains with quenched ``charges'' $\pm 1$. The interaction of charges at neighboring lattice sites is described by $q_i q_j$. We find that…
Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on…
The scaling behavior of self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by Monte Carlo simulations. We apply the pruned-enriched Rosenbluth chain-growth method (PERM). Our…
We present an exact enumeration algorithm for identifying the {\it native} configuration - a maximally compact self avoiding walk configuration that is also the minimum energy configuration for a given set of contact-energy schemes; the…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
Legged robots can pass through complex field environments by selecting gaits and discrete footholds carefully. Traditional methods plan gait and foothold separately and treat them as the single-step optimal process. However, such processing…
Using Monte Carlo dynamics and the Monte Carlo Histogram Method, the simple three-dimensional 27 monomer lattice copolymer is examined in depth. The thermodynamic properties of various sequences are examined contrasting the behavior of good…
We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time $\exp(C\sqrt{n\log n})$ on 2-dimensional lattices and time $\exp(C_dn^{(d-1)/d}\log n)$ on $d$-dimensional lattices for $d>2$.
The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square…
If the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half-space and in a sphere. The ensembles of SAW's used to define these hitting densities involve walks…
The low temperature dynamics of the two- and three-dimensional Ising spin glass model with Gaussian couplings is investigated via extensive Monte Carlo simulations. We find an algebraic decay of the remanent magnetization. For the…