相关论文: Two-dimensional oriented self-avoiding walks with …
The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…
Collective human movement is a hallmark of complex systems, exhibiting emergent order across diverse settings, from pedestrian flows to biological collectives. In high-speed scenarios, alignment interactions ensure efficient flow and…
We present an extension of the corner transfer matrix renormalisation group (CTMRG) method to O(n) invariant models, with particular interest in the self-avoiding walk class of models (O(n=0)). The method is illustrated using an interacting…
We study by Monte Carlo simulations and scaling analysis two models of pairs of confined and dense ring polymers in two dimensions. The pair of ring polymers are modelled by squared lattice polygons confined within a square cavity and they…
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…
The phase diagram and surface critical behaviour of the vertex-interacting self-avoiding walk are examined using transfer matrix methods extended using DMRG and coupled with finite-size scaling. Particular attention is paid to the critical…
We obtain the solution of models of self-avoiding walks with attractive interactions on Husimi lattices built with squares. Two attractive interactions are considered: between monomers on first-neighbor sites and not consecutive along a…
We use an extension of fundamental measure theory to lattice hard-core fluids to study the phase diagram of two different systems. First, two-dimensional parallel hard squares with edge-length $\sigma=2$ in a simple square lattice. This…
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…
We clarify the ground state phase diagram of the half-filled square-lattice Hubbard model with Rashba spin-orbit coupling (SOC) characterized by the spin-split energy bands due to broken inversion symmetry. Although the Rashba metals and…
A phase-separation front will leave in its wake a phase-separated morphology that differs markedly from homogeneous phase-separation morphologies. For a purely diffusive system such a front, moving with constant velocity, will generate very…
Coupled oscillator networks provide mathematical models for interacting periodic processes. If the coupling is weak, phase reduction -- the reduction of the dynamics onto an invariant torus -- captures the emergence of collective dynamical…
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…
We investigate semi-stiff interacting self-avoiding walks on the square lattice with random impurities. The walks are simulated using the flatPERM algorithm and the inhomogeneity is realised as a random fraction of the lattice that is…
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves…
The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails,…
These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the…
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the $n \to 0$ limit of…
We investigate the phase diagram of a self-avoiding walk model of a 3-star polymer in two dimensions, adsorbing at a surface and being desorbed by the action of a force. We show rigorously that there are four phases: a free phase, a…