English
Related papers

Related papers: Two-dimensional self-avoiding walks and polymer ad…

200 papers

There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…

Probability · Mathematics 2019-09-19 Gordon Slade

We consider the critical behaviour of the continuous-time weakly self-avoiding walk with contact self-attraction on $\mathbb{Z}^4$, for sufficiently small attraction. We prove that the susceptibility and correlation length of order $p$ (for…

Mathematical Physics · Physics 2020-04-28 Roland Bauerschmidt , Gordon Slade , Benjamin C. Wallace

We study numerically the nature of the diffusion process on a honeycomb and a quasi-lattice, where a point particle, moving along the bonds of the lattice, scatters from randomly placed scatterers on the lattice sites according to strictly…

comp-gas · Physics 2009-10-28 F. Wang , E. G. D. Cohen

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…

Mathematical Physics · Physics 2015-05-27 Raoul D. Schram , Gerard T. Barkema , Rob H. Bisseling

We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice $\mathbb{Z}^d$ in dimensions $d>4$, in the vicinity of the critical point, and prove an upper bound…

Probability · Mathematics 2022-09-02 Gordon Slade

We consider self-avoiding walk and percolation in $\Zd$, oriented percolation in $\Zd\times\Zp$, and the contact process in $\Zd$, with $p D(\cdot)$ being the coupling function whose range is denoted by $L<\infty$. For percolation, for…

Probability · Mathematics 2007-05-23 Remco van der Hofstad , Akira Sakai

We solve the problem of a chain, modeled as a self-avoiding walk, grafted o the wall limiting a semi-infinite Bethe lattice of arbitrary coordination number q. In particular, we determine the pressure exerted by the polymer on the wall, as…

Statistical Mechanics · Physics 2015-01-21 Rafael Mynssem Brum , Jurgen F. Stilck

We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite…

Probability · Mathematics 2017-02-22 Alessandra Caraceni , Nicolas Curien

We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…

Probability · Mathematics 2009-02-26 E. Csaki , M. Csorgo , A. Foldes , P. Revesz

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

Probability · Mathematics 2026-05-04 Tuan-Minh Nguyen

The two major discrete time formulations for quantum walks, coined and scattering, are unitarily equivalent for arbitrary position dependent transition amplitudes and any topology (PRA {\bf 80}, 052301 (2009)). Although the proof explicit…

Quantum Physics · Physics 2013-04-15 B F Venancio , F M Andrade , M G E da Luz

Recently, it has been proposed that the adsorption transition for a single polymer in dilute solution, modeled by lattice walks in three dimensions, is not universal with respect to inter-monomer interactions. It has also been conjectured…

Statistical Mechanics · Physics 2018-02-21 C. J. Bradly , A. L. Owczarek , T. Prellberg

This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…

Combinatorics · Mathematics 2011-04-08 Martin Klazar

Using Monte Carlo simulations and finite-size scaling analysis, the critical behavior of self-assembled rigid rods on triangular and honeycomb lattices at intermediate density has been studied. The system is composed of monomers with two…

Statistical Mechanics · Physics 2010-10-14 L. G. López , D. H. Linares , A. J. Ramirez-Pastor

We consider self-avoiding lattice polygons, in the hypercubic lattice, as a model of a ring polymer adsorbed at a surface and either being desorbed by the action of a force, or pushed towards the surface. We show that, when there is no…

Statistical Mechanics · Physics 2018-02-14 AJ Guttmann , EJ Janse van Rensburg , I Jensen , SG Whittington

We study a model of spinless fermions on the honeycomb lattice with nearest-neighbor exclusion and extended repulsive interactions that exhibits `lattice supersymmetry' [P. Fendley, K. Schoutens, and J. de Boer, Phys. Rev. Lett. 90, 120402…

Strongly Correlated Electrons · Physics 2024-10-15 Patrick H. Wilhelm , Yves H. Kwan , Andreas M. Läuchli , S. A. Parameswaran

We study the phase diagram of the spin-3/2 Blume-Emery-Griffiths model on a honeycomb lattice by Monte Carlo simulations in order to verify the presence of some peculiar features predicted by the effective field theory (EFT) with…

Statistical Mechanics · Physics 2023-07-19 Milan Žukovič , Michal Jaščur

Some time ago Salmhofer demonstrated the equivalence of the strong coupling lattice Schwinger model with Wilson fermions to a certain 8-vertex model which can be understood as a self-avoiding loop model on the square lattice with bending…

High Energy Physics - Lattice · Physics 2008-11-26 K. Scharnhorst

We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…

High Energy Physics - Lattice · Physics 2009-10-22 A R Conway , A J Guttmann

In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…

Probability · Mathematics 2024-10-08 David A. Croydon , Umberto De Ambroggio