Related papers: Interacting partially directed self avoiding walk …

We study a class of $d$-dimensional random walks, including the two-dimensional simple random walk, reweighted by a self-repelling Gibbsian pair potential. We prove lower bounds on the diffusion constant for short-range interactions, and…

The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…

Tip-driven growth processes underlie the development of many plants. To date, tip-driven growth processes have been modelled as an elongating path or series of segments without taking into account lateral expansion during elongation.…

We consider super-diffusive L\'evy walks in $d \geqslant 2$ dimensions when the duration of a single step, i.e., a ballistic motion performed by a walker, is governed by a power-law tailed distribution of infinite variance and finite mean.…

The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

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,…

The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails,…

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

We consider a model of loop-erased random walks on the finite pre-Sierpinski gasket which permits rigorous analysis. We prove the existence of the scaling limit and show that the path of the limiting process is almost surely self-avoiding,…

The dynamical discrete web (DDW), introduced in recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical parameter s. The evolution is by…

Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersections. On $\mathbb{Z}$, Greven and den Hollander proved in 1993 that the discrete-time weakly self-avoiding walk has an asymptotically…

Two-dimensional (2D) KPZ growth is usually investigated on substrates of lateral sizes $L_x=L_y$, so that $L_x$ and the correlation length ($\xi$) are the only relevant lengths determining the scaling behavior. However, in cylindrical…

We study a series of one-dimensional discrete-time quantum-walk models labeled by half integers $j=1/2, 1, 3/2, ...$, introduced by Miyazaki {\it et al.}, each of which the walker's wave function has $2j+1$ components and hopping range at…

We make a high-precision Monte Carlo study of two- and three-dimensional self-avoiding walks (SAWs) of length up to 80000 steps, using the pivot algorithm and the Karp-Luby algorithm. We study the critical exponents $\nu$ and $2\Delta_4…

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 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…

We perform a Monte Carlo study of $N$-step self-avoiding walks, attached to the corner of an impenetrable wedge in two dimensions ($d=2$), or the tip of an impenetrable cone in $d=3$, of sizes ranging up to $N=10^6$ steps. We find that the…

The statistics of equally weighted random paths (ideal polymer) is studied in $2$ and $3$ dimensional percolating clusters. This is equivalent to diffusion in the presence of a trapping environment. The number of $N$ step walks follows a…

The winding angle probability distribution of a planar self-avoiding walk has been known exactly since a long time: it has a gaussian shape with a variance growing as $<\theta^2>\sim \ln L$. For the three-dimensional case of a walk winding…