Self-avoiding walk

Unsolved problem in mathematics:

Is there a formula or algorithm that can calculate the number of self-avoiding walks in any given lattice?

In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a lattice (a lattice path) that does not visit the same point more than once. This is a special case of the graph theoretical notion of a path. A self-avoiding polygon (SAP) is a closed self-avoiding walk on a lattice. Very little is known rigorously about the self-avoiding walk from a mathematical perspective, although physicists have provided numerous conjectures that are believed to be true and are strongly supported by numerical simulations.

In computational physics, a self-avoiding walk is a chain-like path in $R 2$ or $R 3$ with a certain number of nodes, typically a fixed step length and has the property that it doesn't cross itself or another walk. A system of SAWs satisfies the so-called excluded volume condition. In higher dimensions, the SAW is believed to behave much like the ordinary random walk.

SAWs and SAPs play a central role in the modeling of the topological and knot-theoretic behavior of thread- and loop-like molecules such as proteins. Indeed, SAWs may have first been introduced by the chemist Paul Flory^[1]^{[dubious – discuss]} in order to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point.

SAWs are fractals. For example, in $d = 2$ the fractal dimension is 4/3, for $d = 3$ it is close to 5/3 while for $d \geq 4$ the fractal dimension is $2$ . The dimension is called the upper critical dimension above which excluded volume is negligible. A SAW that does not satisfy the excluded volume condition was recently studied to model explicit surface geometry resulting from expansion of a SAW.^[2]^{[clarification needed]}

The properties of SAWs cannot be calculated analytically, so numerical simulations are employed. The pivot algorithm is a common method for Markov chain Monte Carlo simulations for the uniform measure on $n$ -step self-avoiding walks. The pivot algorithm works by taking a self-avoiding walk and randomly choosing a point on this walk, and then applying symmetrical transformations (rotations and reflections) on the walk after the $n$ th step to create a new walk.

Calculating the number of self-avoiding walks in any given lattice is a common computational problem. There is currently no known formula, although there are rigorous methods of approximation.^[3]^[4]

Universality

One of the phenomena associated with self-avoiding walks and statistical physics models in general is the notion of universality, that is, independence of macroscopic observables from microscopic details, such as the choice of the lattice. One important quantity that appears in conjectures for universal laws is the connective constant, defined as follows. Let $c n$ denote the number of $n$ -step self-avoiding walks. Since every $(n m)$ -step self avoiding walk can be decomposed into an $n$ -step self-avoiding walk and an $m$ -step self-avoiding walk, it follows that $c n m \leq c n c m$ . Therefore, the sequence ${log c n}$ is subadditive and we can apply Fekete's lemma to show that the following limit exists:

\mu =\lim _{n\to \infty }c_{n}^{\frac {1}{n}}.

$μ$ is called the connective constant, since $c n$ depends on the particular lattice chosen for the walk so does $μ$ . The exact value of $μ$ is only known for the hexagonal lattice, where it is equal to:^[5]

{\sqrt {2 {\sqrt {2}}}}.

For other lattices, $μ$ has only been approximated numerically, and is believed not to even be an algebraic number. It is conjectured that^[6]

c_{n}\approx \mu ^{n}n^{\frac {11}{32}}

as $n \to \infty$ , where $μ$ depends on the lattice, but the power law correction $n^{\frac {11}{32}}$ does not; in other words, this law is believed to be universal.

On networks

Self-avoiding walks have also been studied in the context of network theory.^[7] In this context, it is customary to treat the SAW as a dynamical process, such that in every time-step a walker randomly hops between neighboring nodes of the network. The walk ends when the walker reaches a dead-end state, such that it can no longer progress to newly un-visited nodes. It was recently found that on Erdős–Rényi networks, the distribution of path lengths of such dynamically grown SAWs can be calculated analytically, and follows the Gompertz distribution.^[8] For arbitrary networks, the distribution of path lengths of the walk, the degree distribution of the non-visited network and the first-hitting-time distribution to a node can be obtained by solving a set of coupled recurrence equations.^[9]

Limits

Consider the uniform measure on $n$ -step self-avoiding walks in the full plane. It is currently unknown whether the limit of the uniform measure as $n \to \infty$ induces a measure on infinite full-plane walks. However, Harry Kesten has shown that such a measure exists for self-avoiding walks in the half-plane. One important question involving self-avoiding walks is the existence and conformal invariance of the scaling limit, that is, the limit as the length of the walk goes to infinity and the mesh of the lattice goes to zero. The scaling limit of the self-avoiding walk is conjectured to be described by Schramm–Loewner evolution with parameter $κ = .mw-parser-output .sfrac{white-space:nowrap}.mw-parser-output .sfrac.tion,.mw-parser-output .sfrac .tion{display:inline-block;vertical-align:-0.5em;font-size:85%;text-align:center}.mw-parser-output .sfrac .num{display:block;line-height:1em;margin:0.0em 0.1em;border-bottom:1px solid}.mw-parser-output .sfrac .den{display:block;line-height:1em;margin:0.1em 0.1em}.mw-parser-output .sr-only{border:0;clip:rect(0,0,0,0);clip-path:polygon(0px 0px,0px 0px,0px 0px);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}⁠8/3⁠.$

References

^ P. Flory (1953). Principles of Polymer Chemistry. Cornell University Press. p. 672. ISBN 9780801401343.
^ A. Bucksch; G. Turk; J.S. Weitz (2014). "The Fiber Walk: A Model of Tip-Driven Growth with Lateral Expansion". PLOS ONE. 9 (1): e85585. arXiv:1304.3521. Bibcode:2014PLoSO...985585B. doi:10.1371/journal.pone.0085585. PMC 3899046. PMID 24465607.
^ Hayes B (Jul–Aug 1998). "How to Avoid Yourself" (PDF). American Scientist. 86 (4): 314. doi:10.1511/1998.31.3301.
^ Liśkiewicz M; Ogihara M; Toda S (July 2003). "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science. 304 (1–3): 129–56. doi:10.1016/S0304-3975(03)00080-X.
^ Duminil-Copin, Hugo; Smirnov, Stanislav (1 May 2012). "The connective constant of the honeycomb lattice equals sqrt(2 sqrt 2)". Annals of Mathematics. 175 (3): 1653–1665. arXiv:1007.0575. doi:10.4007/annals.2012.175.3.14. S2CID 59164280.
^ Lawler, Gregory F.; Schramm, Oded; Werner, Wendelin (2004). "On the scaling limit of planar self-avoiding walk". Proceedings of Symposia in Pure Mathematics. 72 (2). American Mathematical Society: 339–364. arXiv:math/0204277. doi:10.1090/pspum/072.2/2112127. ISBN 0-8218-3638-2. S2CID 16710180.
^ Carlos P. Herrero (2005). "Self-avoiding walks on scale-free networks". Phys. Rev. E. 71 (3): 1728. arXiv:cond-mat/0412658. Bibcode:2005PhRvE..71a6103H. doi:10.1103/PhysRevE.71.016103. PMID 15697654. S2CID 2707668.
^ Tishby, I.; Biham, O.; Katzav, E. (2016). "The distribution of path lengths of self avoiding walks on Erdős–Rényi networks". Journal of Physics A: Mathematical and Theoretical. 49 (28): 285002. arXiv:1603.06613. Bibcode:2016JPhA...49B5002T. doi:10.1088/1751-8113/49/28/285002. S2CID 119182848.
^ Colombani, G.; Bertagnolli, G.; Artime, O. (2023). "Efficient network exploration by means of resetting self-avoiding random walkers". Journal of Physics: Complexity. 4 (4). arXiv:2310.03203. doi:10.1088/2632-072X/acff33.

External links

OEIS sequence A007764 (Number of nonintersecting (or self-avoiding) rook paths joining opposite corners of an n X n grid)—the number of self-avoiding paths joining opposite corners of an N × N grid, for N from 0 to 12. Also includes an extended list up to N = 21.
Weisstein, Eric W. "Self-Avoiding Walk". MathWorld.
Java applet of a 2D self-avoiding walk
Generic python implementation to simulate SAWs and expanding FiberWalks on a square lattices in n-dimensions.
Norris software to generate SAWs on the Diamond cubic.

[1] P. Flory (1953). Principles of Polymer Chemistry. Cornell University Press. p. 672. ISBN 9780801401343.

[2] A. Bucksch; G. Turk; J.S. Weitz (2014). "The Fiber Walk: A Model of Tip-Driven Growth with Lateral Expansion". PLOS ONE. 9 (1): e85585. arXiv:1304.3521. Bibcode:2014PLoSO...985585B. doi:10.1371/journal.pone.0085585. PMC 3899046. PMID 24465607.

[3] Hayes B (Jul–Aug 1998). "How to Avoid Yourself" (PDF). American Scientist. 86 (4): 314. doi:10.1511/1998.31.3301.

[4] Liśkiewicz M; Ogihara M; Toda S (July 2003). "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science. 304 (1–3): 129–56. doi:10.1016/S0304-3975(03)00080-X.

[5] Duminil-Copin, Hugo; Smirnov, Stanislav (1 May 2012). "The connective constant of the honeycomb lattice equals sqrt(2 sqrt 2)". Annals of Mathematics. 175 (3): 1653–1665. arXiv:1007.0575. doi:10.4007/annals.2012.175.3.14. S2CID 59164280.

[6] Lawler, Gregory F.; Schramm, Oded; Werner, Wendelin (2004). "On the scaling limit of planar self-avoiding walk". Proceedings of Symposia in Pure Mathematics. 72 (2). American Mathematical Society: 339–364. arXiv:math/0204277. doi:10.1090/pspum/072.2/2112127. ISBN 0-8218-3638-2. S2CID 16710180.

[7] Carlos P. Herrero (2005). "Self-avoiding walks on scale-free networks". Phys. Rev. E. 71 (3): 1728. arXiv:cond-mat/0412658. Bibcode:2005PhRvE..71a6103H. doi:10.1103/PhysRevE.71.016103. PMID 15697654. S2CID 2707668.

[8] Tishby, I.; Biham, O.; Katzav, E. (2016). "The distribution of path lengths of self avoiding walks on Erdős–Rényi networks". Journal of Physics A: Mathematical and Theoretical. 49 (28): 285002. arXiv:1603.06613. Bibcode:2016JPhA...49B5002T. doi:10.1088/1751-8113/49/28/285002. S2CID 119182848.

[9] Colombani, G.; Bertagnolli, G.; Artime, O. (2023). "Efficient network exploration by means of resetting self-avoiding random walkers". Journal of Physics: Complexity. 4 (4). arXiv:2310.03203. doi:10.1088/2632-072X/acff33.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

v t e Fractals
Characteristics	Fractal dimensions Assouad Box-counting Higuchi Correlation Hausdorff Packing Topological Recursion Self-similarity
Iterated function system	Barnsley fern Cantor set Koch snowflake Menger sponge Sierpiński carpet Sierpiński triangle Apollonian gasket Fibonacci word Space-filling curve Blancmange curve De Rham curve Minkowski Dragon curve Hilbert curve Koch curve Lévy C curve Moore curve Peano curve Sierpiński curve Z-order curve String T-square n-flake Vicsek fractal Gosper curve Pythagoras tree Weierstrass function
Strange attractor	Multifractal system
L-system	Fractal canopy Space-filling curve H tree
Escape-time fractals	Burning Ship fractal Julia set Filled Newton fractal Douady rabbit Lyapunov fractal Mandelbrot set Misiurewicz point Multibrot set Newton fractal Tricorn Mandelbox Mandelbulb
Rendering techniques	Buddhabrot Orbit trap Pickover stalk
Random fractals	Brownian motion Brownian tree Brownian motor Fractal landscape Lévy flight Percolation theory Self-avoiding walk
People	Michael Barnsley Georg Cantor Bill Gosper Felix Hausdorff Desmond Paul Henry Gaston Julia Niels Fabian Helge von Koch Paul Lévy Aleksandr Lyapunov Benoit Mandelbrot Hamid Naderi Yeganeh Lewis Fry Richardson Wacław Sierpiński
Other	Coastline paradox Fractal art List of fractals by Hausdorff dimension The Fractal Geometry of Nature (1982 book) The Beauty of Fractals (1986 book) Chaos: Making a New Science (1987 book) Kaleidoscope Chaos theory

v t e Stochastic processes
Discrete time	Bernoulli process Branching process Chinese restaurant process Galton–Watson process Independent and identically distributed random variables Markov chain Moran process Random walk Loop-erased Self-avoiding Biased Maximal entropy
Continuous time	Additive process Bessel process Birth–death process pure birth Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Dyson Brownian motion Empirical process Feller process Fleming–Viot process Gamma process Geometric process Hawkes process Hunt process Interacting particle systems Itô diffusion Itô process Jump diffusion Jump process Lévy process Local time Markov additive process McKean–Vlasov process Ornstein–Uhlenbeck process Poisson process Compound Non-homogeneous Schramm–Loewner evolution Semimartingale Sigma-martingale Stable process Superprocess Telegraph process Variance gamma process Wiener process Wiener sausage
Both	Branching process Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process Stochastic chains with memory of variable length White noise
Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Potts model Boolean network Markov random field Percolation Pitman–Yor process Point process Cox Poisson Random field Random graph
Time series models	Autoregressive conditional heteroskedasticity (ARCH) model Autoregressive integrated moving average (ARIMA) model Autoregressive (AR) model Autoregressive–moving-average (ARMA) model Generalized autoregressive conditional heteroskedasticity (GARCH) model Moving-average (MA) model
Financial models	Binomial options pricing model Black–Derman–Toy Black–Karasinski Black–Scholes Chan–Karolyi–Longstaff–Sanders (CKLS) Chen Constant elasticity of variance (CEV) Cox–Ingersoll–Ross (CIR) Garman–Kohlhagen Heath–Jarrow–Morton (HJM) Heston Ho–Lee Hull–White Korn-Kreer-Lenssen LIBOR market Rendleman–Bartter SABR volatility Vašíček Wilkie
Actuarial models	Bühlmann Cramér–Lundberg Risk process Sparre–Anderson
Queueing models	Bulk Fluid Generalized queueing network M/G/1 M/M/1 M/M/c
Properties	Càdlàg paths Continuous Continuous paths Ergodic Exchangeable Feller-continuous Gauss–Markov Markov Mixing Piecewise-deterministic Predictable Progressively measurable Self-similar Stationary Time-reversible
Limit theorems	Central limit theorem Donsker's theorem Doob's martingale convergence theorems Ergodic theorem Fisher–Tippett–Gnedenko theorem Large deviation principle Law of large numbers (weak/strong) Law of the iterated logarithm Maximal ergodic theorem Sanov's theorem Zero–one laws (Blumenthal, Borel–Cantelli, Engelbert–Schmidt, Hewitt–Savage, Kolmogorov, Lévy)
Inequalities	Burkholder–Davis–Gundy Doob's martingale Doob's upcrossing Kunita–Watanabe Marcinkiewicz–Zygmund
Tools	Cameron–Martin formula Convergence of random variables Doléans-Dade exponential Doob decomposition theorem Doob–Meyer decomposition theorem Doob's optional stopping theorem Dynkin's formula Feynman–Kac formula Filtration Girsanov theorem Infinitesimal generator Itô integral Itô's lemma Karhunen–Loève theorem Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prokhorov's theorem Quadratic variation Reflection principle Skorokhod integral Skorokhod's representation theorem Skorokhod space Snell envelope Stochastic differential equation Tanaka Stopping time Stratonovich integral Uniform integrability Usual hypotheses Wiener space Classical Abstract
Disciplines	Actuarial mathematics Control theory Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Signal processing Statistics Stochastic analysis Time series analysis Machine learning
List of topics Category