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

We consider the escape of a flexible, self-avoiding polymer chain out of a confined geometry. By means of simulations, we demonstrate that the translocation time can be described by a simple scaling law that exhibits a nonlinear dependence…

The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…

We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus…

We analyse the conformational behaviour of a linear semiflexible homo-polymer chain confined by two geometrical constraints under a good solvent condition in two dimensions. The constraints are stair shaped impenetrable surfaces. The…

Many biological phenomena such as locomotion, circadian cycles, and breathing are rhythmic in nature and can be modeled as rhythmic dynamical systems. Dynamical systems modeling often involves neglecting certain characteristics of a…

We study the behavior of self avoiding polymers in a background of vertically aligned rods that are either frozen into random positions or free to move horizontally. We find that in both cases the polymer chains are highly elongated, with…

We consider the phase transition induced by compressing a self-avoiding walk in a slab where the walk is attached to both walls of the slab in two and three dimensions, and the resulting phase once the polymer is compressed. The process of…

We have developed a dynamic self-consistent field theory, without any adjustable parameters, for unentangled polymer blends under shear. Our model accounts for the interaction between polymers, and enables one to compute the evolution of…

We study the pedestrian escape from an obscure corridor using a lattice gas model with two species of particles. One species, called passive, performs a symmetric random walk on the lattice, whereas the second species, called active, is…

We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force, concentrating on the case of the square lattice. Using series analysis methods we investigate the…

The study of the effect of random impurities on the collapse of a flexible polymer in dilute solution has had recent attention with consideration of semi-stiff interacting self-avoiding walks on the square lattice. In the absence of…

We study a model of self propelled particles exhibiting run and tumble dynamics on lattice. This non-Brownian diffusion is characterised by a random walk with a finite persistence length between changes of direction, and is inspired by the…

We review models of random geometries based on the dynamical lattice approach. We discuss one dimensional model of simplicial complexes (branched polymers), two dimensional model of dynamical triangulations and four dimensional model of…

We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…

The development of a coherent conceptual basis for the treatment of non-linear microscopic phenomena, such as, hydrodynamic interaction, finite extensibility, excluded volume and internal viscosity, in molecular theories of dilute polymer…

A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…

We study self-avoiding walks on the square lattice restricted to a square box of side $L$ weighted by a length fugacity without restriction of their end points. This models a confined polymer in dilute solution. The model admits a phase…

We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…

Lattice paths are functional entities that model efficient navigation in discrete/grid maps. This paper presents a new scheme to generate collision-free lattice paths with utmost efficiency using the bijective property to rooted ordered…

Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex is adjacent to the…