English
Related papers

Related papers: Self-avoiding walk, spin systems, and renormalizat…

200 papers

We study a lattice model of a magnetic polymer where the XY spin variables are located on a self-avoiding walk (SAW) on a regular lattice in two and three dimensions. We consider the regime where both spins and conformations are dynamic,…

Statistical Mechanics · Physics 2024-05-14 Kamilla Faizullina , Evgeni Burovski

We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…

Probability · Mathematics 2018-03-29 Volker Betz , Lorenzo Taggi

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…

Probability · Mathematics 2012-06-12 Roland Bauerschmidt , Hugo Duminil-Copin , Jesse Goodman , Gordon Slade

We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…

Probability · Mathematics 2016-06-22 Ariel Yadin

We study the 4-dimensional $n$-component $|\varphi|^4$ spin model for all integers $n \ge 1$, and the 4-dimensional continuous-time weakly self-avoiding walk which corresponds exactly to the case $n=0$ interpreted as a supersymmetric spin…

Mathematical Physics · Physics 2019-08-21 Roland Bauerschmidt , Gordon Slade , Alexandre Tomberg , Benjamin C. Wallace

This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…

Statistical Mechanics · Physics 2007-05-23 Guy Fayolle , Cyril Furtlehner

We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…

High Energy Physics - Lattice · Physics 2008-11-26 A R Conway , I G Enting , A J Guttmann

The non-perturbative renormalization-group approach is extended to lattice models, considering as an example a $\phi^4$ theory defined on a $d$-dimensional hypercubic lattice. Within a simple approximation for the effective action, we solve…

Statistical Mechanics · Physics 2009-03-02 N. Dupuis , K. Sengupta

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…

Quantum Physics · Physics 2015-01-08 Elizabeth Camilleri , Peter P. Rohde , Jason Twamley

This paper is the fifth in a series devoted to the development of a rigorous renormalisation group method applicable to lattice field theories containing boson and/or fermion fields, and comprises the core of the method. In the…

Mathematical Physics · Physics 2015-06-19 David C. Brydges , Gordon Slade

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…

Statistical Mechanics · Physics 2009-11-07 John Cardy

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…

Statistical Mechanics · Physics 2015-06-12 Damien P. Foster , Claire Pinettes

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…

Statistical Mechanics · Physics 2015-04-09 Nathan Clisby

We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…

Statistical Mechanics · Physics 2008-08-28 A. N. Rogers , C. Richard , A. J. Guttmann

Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the basis of protein structure prediction in bioinformatics.…

Biomolecules · Quantitative Biology 2013-06-07 Jacques M. Bahi , Christophe Guyeux , Jean-Marc Nicod , Laurent Philippe

Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…

Combinatorics · Mathematics 2026-02-17 Benjamin Grant , Zhongyang Li

We compute the renormalized trajectory of $\phi^4_4$-theory by perturbation theory in a running coupling. We use an exact infinitesimal renormalization group. The expansion is put into a form which is manifestly independent of the scale…

High Energy Physics - Theory · Physics 2008-02-03 Christian Wieczerkowski

Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…

Statistical Mechanics · Physics 2023-02-21 Dušanka Marčetić

This paper is the fourth in a series devoted to the development of a rigorous renormalisation group method for lattice field theories involving boson fields, fermion fields, or both. The third paper in the series presents a perturbative…

Mathematical Physics · Physics 2015-06-19 David C. Brydges , Gordon Slade

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…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou