Related papers: Self-avoiding walks and polygons -- an overview
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…
Advanced chain-growth computer simulation methodologies have been employed for a systematic statistical analysis of the critical behavior of a polymer adsorbing at a substrate. We use finitesize scaling techniques to investigate the…
This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
Dilute or semi-dilute solutions of non-intersecting self-avoiding walk (SAW) polymer chains are mapped onto a fluid of ``soft'' particles interacting via an effective pair potential between their centers of mass. This mapping is achieved by…
We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…
While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a…
We consider the two-dimensional self-avoiding walk (SAW) in a simply connected domain that contains the origin. The SAW starts at the origin and ends somewhere on the boundary. The distribution of the endpoint along the boundary is expected…
We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
This PhD thesis is dedicated to the study of the interplay between symmetries of quantum states and their self-similar properties. It consists of three connected threads of research: polynomial invariants for multiphoton states,…
We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder,…
We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…
Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the…
In our previous work, we defined a prime walk (PW) on a square grid and presented several intriguing numerical results. Here, we demonstrate the main conjecture presented there, namely, that the area covered by the prime walk is unbounded.…
A mapping between random walk problems and resistor network problems is described and used to calculate the effective resistance between any two nodes on an infinite two-dimensional square lattice of unit resistors. The superposition…
The critical behaviour of directed self-avoiding walks is studied on parabolic-like systems with a free boundary at x=\pm Ct^\alpha. Using a scaling argument, 1/C is shown to be a marginal variable when \alpha=\nu_\perp/\nu_\parallel=1/2,…
Self-avoiding walks self-interacting via nearest neighbours (ISAW) and self-avoiding trails interacting via multiply-visited sites (ISAT) are two models of the polymer collapse transition of a polymer in dilute solution. On the square…
A fundamental paradigm in polymer physics is that macromolecular conformations in equilibrium can be described by universal scaling laws, being key for structure, dynamics, and function of soft (biological) matter and in the materials…
A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…