相关论文: Bilocal Dynamics for Self-Avoiding Walks

We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on…

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$.

In the framework of Husimi and Bethe lattices, we investigate a generalized polymer model that incorporates as special cases different models previously studied in the literature, namely, the standard interacting self-avoiding walk, the…

We consider a fully directed self-avoiding walk model on a cubic lattice to mimic the conformations of an infinitely long confined flexible polymer chain; and the confinement condition is achieved by two parallel athermal plates. The…

The self-avoiding walk, and lattice spin systems such as the $\varphi^4$ model, are models of interest both in mathematics and in physics. Many of their important mathematical problems remain unsolved, particularly those involving critical…

Polymer systems in slab geometries are studied on the basis of the recently presented Gaussian Ellipsoid Model [J. Chem. Phys. 114, 7655 (2001)].The potential of the confining walls has an exponential shape. For homogeneous systems in…

A variety of transport processes in natural and man-made systems are intrinsically random. To model their stochasticity, lattice random walks have been employed for a long time, mainly by considering Cartesian lattices. However, in many…

Interacting Growth Walks is a recently proposed stochastic model for studying the coil-globule transition of linear polymers. We propose a flat energy histogram version for Interacting Growth Walk. We demonstrate the algorithm on two…

We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…

In this paper we study a two-dimensional directed self-avoiding walk model of a random copolymer in a random emulsion.

We consider a simple lattice model of a topological phase transition in open polymers. To be precise, we study a model of self-avoiding walks on the simple cubic lattice tethered to a surface and weighted by an appropriately defined writhe.…

Terrain geometry is, in general, non-smooth, non-linear, non-convex, and, if perceived through a robot-centric visual unit, appears partially occluded and noisy. This work presents the complete control pipeline capable of handling the…

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 investigate self-avoiding walk models of linear block copolymers adsorbed at a surface and desorbed by the action of a force. We rigorously establish the dependence of the free energy on the adsorption and force parameters, and the form…

Peridynamics describes the nonlinear interactions in spatially extended Hamiltonian systems by nonlocal integro-differential equations, which can be regarded as the natural generalization of lattice models. We prove the existence of…

We present a sampling-based kinodynamic planning framework for a bipedal robot in complex environments. Unlike other footstep planner which typically plan footstep locations and the biped dynamics in separate steps, we handle both…

Slow self-avoiding adaptive walks by an infinite radius search algorithm (Limax) are analyzed as themselves, and as the network they form. The study is conducted on several NK problems and two HIFF problems. We find that examination of such…

We study the motion of a particle on the two-dimensional honeycomb lattice, whose sites are occupied by either flipping rotators or flipping mirrors, which scatter the particle according to a deterministic rule. For both types of scatterers…

For more than a century lattice random walks have been employed ubiquitously, both as a theoretical laboratory to develop intuition about more complex stochastic processes and as a tool to interpret a vast array of empirical observations.…

We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…