Related papers: Self-avoiding walks and polygons -- an overview
We use the lattice model of directed walks to investigate the conformational as well as the adsorption properties of a semiflexible homopolymer chain immersed in a good solvent in two and three dimensions. To account for the stiffness in…
There has recently been considerable interest in quantum walks in connection with quantum computing. The walk can be considered as a quantum version of the so-called correlated random walk. We clarify a strong structural similarity between…
We present improved simulations of three-dimensional self avoiding walks with one end attached to an impenetrable surface on the simple cubic lattice. This surface can either be a-thermal, having thus only an entropic effect, or attractive.…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…
In this article, we prove sub-ballisticity for a class of self-repelling polymers inZ^d. Self-repelling polymers are a two-way generalization of the model of self-avoiding walks, for which the sub-ballisticity was proved by H. Duminil-Copin…
This paper proves the formula \nu(d) =1 for d=1 and \nu(d) = max(1/4 +1/d, 1/2) for d > 1 for the root mean square displacement exponent \nu(d) of the self-avoiding walk (SAW) in Z^d, and thus, resolves some major long-standing open…
Single three dimensional polymers confined to a slab, i.e. to the region between two parallel plane walls, are studied by Monte Carlo simulations. They are described by $N$-step walks on a simple cubic lattice confined to the region $1 \le…
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
We consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results…
In recent work [PRE 100, 022121 (2019)] evidence was found that the surface adsorption transition of interacting self-avoiding trails (ISATs) placed on the square lattice displays a non-universal behavior at the special adsorption point…
In a recent letter, a simple method was proposed to generate solvable models that predict the critical properties of statistical systems in hyperspherical geometries. To that end, it was shown how to reduce a random walk in $D$ dimensions…
Large-scale analysis of pedestrian infrastructures, particularly sidewalks, is critical to human-centric urban planning and design. Benefiting from the rich data set of planimetric features and high-resolution orthoimages provided through…
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…
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…
Quantitatively modeling the trajectories and behavior of pedestrians walking in crowds is an outstanding fundamental challenge deeply connected with the physics of flowing active matter, from a scientific point of view, and having societal…
We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They…
We solve a model of self-avoiding walks which allows for a site to be visited up to two times by the walk on the Husimi lattice. This model is inspired in the Domb-Joyce model and was proposed to describe the collapse transition of polymers…
A lattice model of the directed self-avoiding walk is used to estimate the possibility on the formation of an infinitely long linear semi-flexible copolymer chain. The copolymer chain is assumed to composed of four different types of the…