Related papers: A solvable non-directed model of polymer adsorptio…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…
We study the adsorption of polymer chains on a fluctuating surface. Physical examples are provided by polymer adsorption at the rough interface between two non-miscible liquids, or on a membrane. In a mean-field approach, we find that the…
The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures…
This is a rather personal review of the problem of self-avoiding walks and polygons. After defining the problem, and outlining what is known rigorously and what is merely conjectured, I highlight the major outstanding problems. I then give…
We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…
The critical adsorption point (CAP) of self-avoiding walks (SAW) interacting with a planar surface with surface disorder or sequence disorder has been studied. We present theoretical equations, based on ones previously developed by Soteros…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…
We discuss the generalization of a classical problem involving an $N$-step ideal polymer adsorption at a sticky boundary (potential well of depth $U$). It is known that as $N$ approaches infinity, the path undergoes a 2nd-order localization…
We study a model of two polymers confined to a slit with sticky walls. More precisely, we find and analyse the exact solution of two directed friendly walks in such a geometry on the square lattice. We compare the infinite slit limit, in…
Adsorption of polymers to surfaces is crucial for understanding many fundamental processes in nature. Recent experimental studies indicate that the adsorption dynamics is dominated by non-equilibrium effects. We investigate the adsorption…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Three-dimensional Monte Carlo simulations provide a striking confirmation to a recent theoretical prediction: the Brownian non-Gaussian diffusion of critical self-avoiding walks. Although the mean square displacement of the polymer center…
A directed path in the vicinity of a hard wall exerts pressure on the wall because of loss of entropy. The pressure at a particular point may be estimated by estimating the loss of entropy if the point is excluded from the path. In this…
Using extensive Monte Carlo simulations, we investigate the surface adsorption of self-avoiding trails on the triangular lattice with two- and three-body on-site monomer-monomer interactions. In the parameter space of two-body, three-body,…
We analyze response of a macromolecule near to a substrate; the substrate is tiled in the sequential and specific manner so that repeat units of the macromolecule may have different response on its adsorption in different directions onto…
We introduce and solve from first principles a continuous-time quantum walk with absorption generated by a Lindblad boundary sink of arbitrary strength. Tracing out the sink maps the problem onto a non-Hermitian tight-binding Hamiltonian…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
We have performed chain-growth simulations of minimalistic hybrid lattice models for polymers interacting with interfaces of attractive solid substrates in order to gain insights into the conformational transitions of the polymers in the…
We introduce a new type of discrete quantum walks, called vertex-face walks, based on orientable embeddings. We first establish a spectral correspondence between the transition matrix $U$ and the vertex-face incidence structure. Using the…