Related papers: Self-avoiding walks and polygons -- an overview
We solve the problem of a chain, modeled as a self-avoiding walk, grafted o the wall limiting a semi-infinite Bethe lattice of arbitrary coordination number q. In particular, we determine the pressure exerted by the polymer on the wall, as…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…
For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…
We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…
Based on transfer matrix techniques and finite size scaling, we study the oriented polymer (self-avoiding walk) with nearest neighbor interaction. In the repulsive regime, various critical exponents are computed and compared with exact…
A phase diagram for a surface-interacting long flexible polymer chain in a two-dimensional poor solvent where the possibility of collapse exists is determined using exact enumeration method. A model of a self-attracting self avoiding walk…
In the present work, the cyclic polymer chains (rings) in structurally disordered environment (e.g. in the cross-linked polymer gel) are studied exploiting the model of closed self-avoiding walks (SAWs) trajectories on $d=3$-dimensional…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…
We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…
We investigate neighbor-avoiding walks on the simple cubic lattice in the presence of an adsorbing surface. This class of lattice paths has been less studied using Monte Carlo simulations. Our investigation follows on from our previous…
Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the $n \to 0$ limit of…
This paper studies the problem of polygonal mapping of buildings by tackling the issue of mask reversibility that leads to a notable performance gap between the predicted masks and polygons from the learning-based methods. We addressed such…
We introduce the geodesic walk for sampling Riemannian manifolds and apply it to the problem of generating uniform random points from polytopes in R^n specified by m inequalities. The walk is a discrete-time simulation of a stochastic…
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does…
Scaling arguments are used to analyze the size of topologically constrained closed ring polymer with excluded volume. It is found that there exists a finite range of polymer thickness (excluded volume) in which self-avoidance is unimportant…
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…
Self-interacting random walks (SIRWs) show long-range memory effects that result from the interaction of the random walker at time $t$ with the territory already visited at earlier times $t'<t$. This class of non-Markovian random walks has…