Related papers: Scaling limit of a self-avoiding walk interacting …
We show that the `erasing-larger-loops-first' (ELLF) method, which was first introduced for erasing loops from the simple random walk on the Sierpinski gasket, does work also for non-Markov random walks, in particular, self-repelling walks…
Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…
We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…
Self-repelling two-leg (biped) spider walk is considered where the local stochastic movements are governed by two independent control parameters $ \beta_d$ and $ \beta_h $, so that the former controls the distance ($ d $) between the legs…
This paper shows the convergence of adele-valued random walks to an adelic L\'evy process under scaling limits. We use random walks on the $p$-adic numbers to construct random walks initially on the infinite product space, and use survival…
The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We…
We conjecture a relationship between the scaling limit of the fixed-length ensemble of self-avoiding walks in the upper half plane and radial SLE with kappa=8/3 in this half plane from 0 to i. The relationship is that if we take a curve…
We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…
We consider trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of…
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…
A celebrated problem in numerical analysis is to consider Brownian motion originating at the centre of a $10 \times 1$ rectangle, and to evaluate the ratio of probabilities of a Brownian path hitting the short ends of the rectangle before…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
We study paths of time-length $t$ of a continuous-time random walk on $\mathbb Z^2$ subject to self-interaction that depends on the geometry of the walk range and a collection of random, uniformly positive and finite edge weights. The…
We consider self-avoiding walks (SAWs) on the backbone of percolation clusters in space dimensions d=2, 3, 4. Applying numerical simulations, we show that the whole multifractal spectrum of singularities emerges in exploring the…
The paper deals with the asymptotic properties of a symmetric random walk in a high contrast periodic medium in $\mathbb Z^d$, $d\geq 1$. We show that under proper diffusive scaling the random walk exhibits a non-standard limit behaviour.…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…
The kinetics of annihilating random walks in one dimension, with the half-line x>0 initially filled, is investigated. The survival probability of the nth particle from the interface exhibits power-law decay, S_n(t)~t^{-alpha_n}, with…