Related papers: Improved lower bounds on the connective constants …
We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…
We have analysed the recently extended series for the number of self-avoiding walks (SAWs) $C_L(1)$ that cross an $L \times L$ square between diagonally opposed corners. The number of such walks is known to grow as $\lambda_S^{L^2}.$ We…
We study the winding angles of random and self-avoiding walks on square and cubic lattices with number of steps $N$ ranging up to $10^7$. We show that the mean square winding angle $\langle\theta^2\rangle$ of random walks converges to the…
We provide the first mathematical proof that the connective constant of the hexagonal lattice is equal to $\sqrt{2+\sqrt 2}$. This value has been derived non rigorously by B. Nienhuis in 1982, using Coulomb gas approach from theoretical…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We study the high-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in 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.
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
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…
Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…
In this paper we study the number of returns to the coordinate hyperplanes for multidimensional nearest-neighbour random walks. While one-dimensional results on returns are classical, much less is known in higher dimensions. We analyse the…
A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making the process thousands or millions of…
We compute the exponent gamma for self-avoiding walks in three dimensions. We get gamma = 1.1575 +- 0.0006 in agreement with renormalization-group predictions. Earlier Monte Carlo and exact-enumeration determinations are now seen to be…
We study downward deviations of the boundary of the range of a transient walk on the Euclidean lattice. We describe the optimal strategy adopted by the walk in order to shrink the boundary of its range. The technics we develop apply equally…
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 connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective…
We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…