Related papers: Interacting partially directed self avoiding walk …
We consider the stochastic evolution of a 1+1-dimensional interface (or polymer) in presence of a substrate. This stochastic process is a dynamical version of the homogeneous pinning model. We start from a configuration far from…
We present a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…
We consider correlated L\'evy walks on a class of two- and three-dimensional deterministic self-similar structures, with correlation between steps induced by the geometrical distribution of regions, featuring different diffusion properties.…
In this article we study a \emph{non-directed} polymer model in dimension $d\ge 2$: we consider a simple symmetric random walk on $\mathbb{Z}^d$ which interacts with a random environment, represented by i.i.d. random variables…
We consider the statistical mechanics of a random polymer with random walks and disorders in $\mathbb{Z}^d$. The walk collects random disorders along the way and gets nothing if it visits the same site twice. In the continuum and weak…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
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…
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…
This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…
We consider directed polymer models involving multiple non-intersecting random walks moving through a space-time disordered environment in one spatial dimension. For a single random walk, Alberts, Khanin and Quastel proved that under…
Many important transport phenomena are described by simple mathematical models rooted in the diffusion equation. Geometrical constraints present in such phenomena often have influence of a universal sort and manifest themselves in scaling…
We study the temporal growth of the von Neumann entropy for dissipative quantum walks on networks. By using a phenomenological quantum master equation, the quantum stochastic walk (QSW), we are able to parametrically scan the crossover from…
Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…
We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-\delta -1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that…
We consider line ensembles of non-intersecting random walks constrained by a hard wall, each tilted by the area underneath it with geometrically growing pre-factors $\mathfrak{b}^i$ where $\mathfrak{b}>1$. This is a model for the level…
The density crossover scaling of various thermodynamic properties of solutions and melts of self-avoiding and highly flexible polymer chains without chain intersections confined to strictly two dimensions is investigated by means of…
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…
The infinite two-sided loop-erased random walk (LERW) is a measure on infinite self-avoiding walks that can be viewed as giving the law of the `middle part' of an infinite LERW loop going through 0 and infinity. In this note we derive…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
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…