Related papers: Self-avoiding walk on nonunimodular transitive gra…
We calculate the connective constant for self-avoiding walks on the simple cubic lattice to unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that \mu = 4.684 039 931(27). Our method also provides…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
We use the recently conjectured exact $S$-matrix of the massive ${\rm O}(n)$ model to derive its form factors and ground state energy. This information is then used in the limit $n\to0$ to obtain quantitative results for various universal…
Over the years, problems like percolation and self-avoiding walks have provided important testing grounds for our understanding of the nature of the critical state. I describe some very recent ideas, as well as some older ones, which cast…
We investigate both analytically and numerically the ensemble of minimum-weight loops and paths in the negative-weight percolation model on random graphs with fixed connectivity and bimodal weight distribution. This allows us to study the…
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
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…
We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the…
We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…
We prove several rigorous results about the asymptotic behaviour of the numbers of polygons and self-avoiding walks confined to a square on the square lattice. Specifically we prove that the dominant asymptotic behaviour of polygons…
We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips $\mathbb{Z} \times \{-1,0,1\}$ and $\mathbb{Z}\times \{-1,0,1,2\}$. We obtain the value of the connective constant for the $\mathbb{Z} \times…
We prove that the rescaled ``true'' self-avoiding walk $(n^{-2/3}X_{\lfloor nt \rfloor})_{t\in\mathbb{R}_+}$ converges weakly as $n$ goes to infinity to the ``true'' self-repelling motion constructed by T\'oth and Werner. The proof features…
In this paper, we investigate a model for a $1+1$ dimensional self-interacting and partially directed self-avoiding walk, usually referred to by the acronym IPDSAW. The interaction intensity and the free energy of the system are denoted by…
We prove that a class of random walks on $\Z^2$ with long-range self-repulsive interactions have a diffusive-ballistic phase transition.
The number of walks of $k$ steps from the node $\mathsf{0}$ to the node $\lambda$ on the representation graph (McKay quiver) determined by a finite group $\mathsf{G}$ and a $\mathsf{G}$-module $\mathsf{V}$ is the multiplicity of the…
This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…
Results of a numerically exact transfer matrix calculation for the model of Interacting Self-Avoiding Trails are presented. The results lead to the conclusion that, at the collapse transition, Self-Avoiding Trails are in the same…
Three-dimensional Monte Carlo simulations provide a striking confirmation to a recent theoretical prediction: the Brownian non-Gaussian diffusion of critical self-avoiding walks. Although the mean square displacement of the polymer center…