Related papers: Weakly self-avoiding walk on a high-dimensional to…

Let $W_d(n)$ be the number of $2n$-step walks in $\mathbb{Z}^d$ which begin and end at the origin. We study the exponent of $2$ in the prime factorisation of this number; i.e., $w_d(n) = \nu_2(W_d(n))$. We show that, for each $d$, there is…

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

We study the scaling limit of a branching random walk in static random environment in dimension $d=1,2$ and show that it is given by a super-Brownian motion in a white noise potential. In dimension $1$ we characterize the limit as the…

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 analyze the differences between the horizontal and the vertical component of the simple random walk on the 2-dimensional comb. In particular we evaluate by combinatorial methods the asymptotic behaviour of the expected value of the…

We establish the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point $n \vec{a}$ for $\vec{a}$ in $Z^d$, as $n$ increases to infinity.

We introduce and study an interacting particle system evolving on the $d$-dimensional torus $(\mathbb Z/N\mathbb Z)^d$. Each vertex of the torus can be either empty or occupied by an individual of type $\lambda \in (0,\infty)$. An…

Topological order, the hallmark of fractional quantum Hall states, is primarily defined in terms of ground-state degeneracy on higher-genus manifolds, e.g. the torus. We investigate analytically and numerically the smooth crossover between…

We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…

Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…

We reconsider the problem of even-visiting random walks in one dimension. This problem is mapped onto a non-Hermitian Anderson model with binary disorder. We develop very efficient numerical tools to enumerate and characterize even-visiting…

It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $\kappa = 8/3.$ We consider SAWs in…

We study random walks on a $d$-dimensional torus by affine expanding maps whose linear parts commute. Assuming an irrationality condition on their translation parts, we prove that the Haar measure is the unique stationary measure. We deduce…

The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be…

Suppose that the vertices of a regular graph are coloured red and blue with an equal number of each (we call this a balanced colouring). Since the graph is undirected, the number of edges from a red vertex to a blue vertex is clearly the…

We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the…

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on ${\mathbb{Z}}^d$. The two-point functions of these models are respectively the generating function for self-avoiding walks from…

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…

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…