Related papers: Positive speed self-avoiding walks on graphs with …
In a 1976 paper published in Science, Knuth presented an algorithm to sample (non-uniform) self-avoiding walks crossing a square of side k. From this sample, he constructed an estimator for the number of such walks. The quality of this…
We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…
We study a lattice gas of persistent walkers, in which each site is occupied by at most one particle and the direction each particle attempts to move to depends on its last step. We analyse the mean squared displacement (MSD) of the…
We prove that self-avoiding walk on Z^d is sub-ballistic in any dimension d at least two. That is, writing ||u|| for the Euclidean norm of u \in Z^d, and SAW_n for the uniform measure on self-avoiding walks gamma:{0,...,n} \to Z^d for which…
We show that if the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half space and in a sphere. We test these predictions by Monte Carlo simulations and find…
Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the "forward" neighbours of the actual state, i.e., it does not go back along the…
The scaling limit of the two-dimensional self-avoiding walk (SAW) is believed to be given by the Schramm-Loewner evolution (SLE) with the parameter kappa equal to 8/3. The scaling limit of the SAW has a natural parameterization and SLE has…
We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…
Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…
For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a $\mathsf{W}_n$-distributed walk. We show that…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
We study the problem of counting all cycles or self-avoiding walks (SAWs) on triangulated planar graphs. We present a subexponential $2^{O(\sqrt{n})}$ time algorithm for this counting problem. Among the technical ingredients used in this…
We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…
We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…
We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an $\ell^\infty$-infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…