Related papers: Two-dimensional lattice polymers: adaptive windows…
In this paper we present simulations of a surface-adsorbed polymer subject to an elongation force. The polymer is modelled by a self-avoiding walk on a regular lattice. It is confined to a half-space by an adsorbing surface with attractions…
Using Wang-landau algorithm combined with analytic method, the density of states of two dimensional XY model on square lattices of sizes $16\times16$, $24\times24$ and $32\times32$ is accurately calculated. Thermodynamic quantities, such as…
The exact grand-canonical solution of a generalized interacting self-avoid walk (ISAW) model, placed on a Husimi lattice built with squares, is presented. In this model, beyond the traditional interaction $\omega_1=e^{\epsilon_1/k_B T}$…
Using extensive Monte Carlo simulations, we study the interface localization- delocalization transition of a thin Ising film with antisymmetric competing walls for a set of parameters where the transition is strongly first-order. This is…
By means of contact-density chain-growth simulations, we investigate a simple lattice model of a flexible polymer interacting with an attractive substrate. The contact density is a function of the numbers of monomer-substrate and…
Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in lattice-based models. Here, we develop a formalism based on interacting binary tensors that allows for tackling…
Linear polymers adsorbing on a wall can be modelled by half-space self-avoiding walks adsorbing on a line in the square lattice, or on a surface in the cubic lattice. In this paper a numerical approach based on the GAS algorithm is used to…
The conformations of interacting linear polymers on a dynamical planar random lattice are studied using a random two-matrix model. An exact expression for the partition function of self-avoiding chains subject to attractive contact…
We write exact equations for the thermodynamic properties of a linear polymer molecule confined to walk on a lattice of finite size. The dimension of the space in which the lattice resides can be arbitrary. We also calculate polymer…
We develop a theory describing density profile of the semi-flexible polymers absorbed onto a planar surface. The theoretical analysis consists of two parts. As a first part, we calculate a density profile of the adsorbed polymers by…
Single two dimensional polymers confined to a strip are studied by Monte Carlo simulations. They are described by N-step self-avoiding random walks on a square lattice between two parallel hard walls with distance 1 << D << N^\nu (\nu = 3/4…
We show that a histogram maintained throughout the Wang-Landau (WL) sampling for the energy entries visited during the simulation could be used to make the simulated density of states (DOS) converge. The method is easy to be implemented to…
We study a family of lattice-gas systems defined on semiregular grids, obtained by projecting the vertices of three different geodesic icosahedra onto a spherical surface. By using couplings up to third neighbors we explore various…
The density of states of continuous models is known to span many orders of magnitudes at different energies due to the small volume of phase space near the ground state. Consequently, the traditional Wang-Landau sampling which uses the same…
Polymer chains with hard-core interaction on a two-dimensional lattice are modeled by directed random walks. Two models, one with intersecting walks (IW) and another with non-intersecting walks (NIW) are presented, solved and compared. The…
A polymer chain tethered to a surface may be compact or extended, adsorbed or desorbed, depending on interactions with the surface and the surrounding solvent. This leads to a rich phase diagram with a variety of transitions. To investigate…
We introduce a rejection-free, flat histogram, cluster algorithm to determine the density of states of hard-core lattice gases. We show that the algorithm is able to efficiently sample low entropy states that are usually difficult to…
We point out that a newly introduced recursive algorithm for lattice polymers has a much wider range of applicability. In particular, we apply it to the simulation of off-lattice polymers with Lennard-Jones potentials between non-bonded…
We present a rigorous derivation for off-lattice implementations of the so-called "random-walk" algorithm recently introduced by Wang and Landau [PRL 86, 2050 (2001)]. Originally developed for discrete systems, the algorithm samples…
We study the diffusion process through an ideal polymer network, using numerical methods. Polymers are modeled by random walks on the bonds of a two-dimensional square lattice. Molecules occupy the lattice cells and may jump to the…