Related papers: Two-dimensional self-avoiding walks and polymer ad…
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…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…
We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…
We construct solvable models on the honeycomb lattice by combining three faces of the square lattice solvable models into a hexagon face. These models contain two independent, anisotropy controlling, spectral parameters and their transfer…
We show that the interplay between geometric criticality and dynamical fluctuations leads to a novel universality class of the contact process on a randomly diluted lattice. The nonequilibrium phase transition across the percolation…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…
We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that corresponds to the probability that pairs of…
We study an homogeneous irreducible markovian random walk in a square lattice of arbitrary dimension, with an antisymmetric perturbation acting only in one point. We compute exactly spatial correction to the diffusive behaviour in the…
We use numerical transfer-matrix methods, together with finite-size scaling and conformal invariance concepts, to discuss critical properties of two-dimensional honeycomb-lattice Ising spin-1/2 magnets, with couplings which are…
In recent work [PRE 100, 022121 (2019)] evidence was found that the surface adsorption transition of interacting self-avoiding trails (ISATs) placed on the square lattice displays a non-universal behavior at the special adsorption point…
We consider spontaneous symmetry breaking transitions of strongly interacting two-dimensional Dirac fermions minimally coupled to mass and emergent gauge field order parameters. Using a renormalization group analysis, we show that the…
This work is concerned with the Dirac points for the honeycomb lattice with impenetrable obstacles arranged periodically in a homogeneous medium. We consider both the Dirichlet and Neumann eigenvalue problems and prove the existence of…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…
We describe some ideas of John Hammersley for proving the existence of critical exponents for two-dimensional self-avoiding walks and provide numerical evidence for their correctness.
In the framework of Husimi and Bethe lattices, we investigate a generalized polymer model that incorporates as special cases different models previously studied in the literature, namely, the standard interacting self-avoiding walk, the…
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…
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…