|
|
| Line 1: |
Line 1: |
| [[File:Self avoiding walk.svg|200px|right]]
| | Hello, my title is Andrew and my wife doesn't like it at all. Invoicing is what I do for a living but I've usually needed my own business. My spouse and I reside in Mississippi and I love every working day residing here. To perform lacross is some thing I truly appreciate performing.<br><br>Here is my homepage - email psychic readings ([http://ustanford.com/index.php?do=/profile-38218/info/ http://ustanford.com/]) |
| | |
| In mathematics, a '''self-avoiding walk''' ('''SAW''') is a sequence of moves on a [[lattice (group)|lattice]] that does not visit the same point more than once. A '''self-avoiding polygon''' ('''SAP''') is a closed self-avoiding walk on a lattice. SAWs were first introduced by the chemist [[Paul Flory]]<ref>{{cite book|author=[[Paul Flory|P. Flory]]|title=Principles of Polymer Chemistry|year=1953|publisher=Cornell University Press|isbn= 9780801401343|pages=672}}</ref> in order to model the real-life behavior of chain-like entities such as [[solvent]]s and [[polymer]]s, whose physical volume prohibits multiple occupation of the same spatial point. 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 <math>\mathbb{R}^2</math> or <math>\mathbb{R}^3</math> with a certain number of nodes, typically a fixed step length and has the imperative property that it doesn't cross itself or another walk. A system of self-avoiding walks satisfies the so-called [[excluded volume]] condition. In higher dimensions, the self-avoiding walk is believed to behave much like the ordinary [[random walk]]. SAWs and SAPs play a central role in the modelling of the [[topology|topological]] and [[knot theory|knot-theoretic]] behaviour of thread- and loop-like molecules such as [[protein]]s. SAW is a [[fractal]].<ref>
| |
| {{cite journal
| |
| |author= [[Shlomo Havlin|S. Havlin]], D. Ben-Avraham
| |
| |year= 1982
| |
| |title= New approach to self-avoiding walks as a critical phenomenon
| |
| |journal= J. Phys. A
| |
| |volume= 15
| |
| |issue=
| |
| |pages= 321
| |
| |publisher=
| |
| |url= http://havlin.biu.ac.il/Publications.php?keyword=New+approach+to+self-avoiding+walks+as+a+critical+phenomenon&year=*&match=all
| |
| }}</ref><ref>{{cite journal
| |
| |author= [[Shlomo Havlin|S. Havlin]], D. Ben-Avraham
| |
| |year= 1982
| |
| |title= Theoretical and numerical study of fractal dimensionality in self-avoiding walks
| |
| |journal= Phys. Rev. A
| |
| |volume= 26
| |
| |issue= 3
| |
| |pages= 1728
| |
| |doi=10.1103/PhysRevA.26.1728
| |
| |url= http://havlin.biu.ac.il/Publications.php?keyword=Theoretical+and+numerical+study+of+fractal+dimensionality+in+self-avoiding+walks&year=*&match=all
| |
| |bibcode = 1982PhRvA..26.1728H }}</ref> For example, in ''d'' = 2 the [[fractal dimension]] is 4/3, for ''d'' = 3 it is close to 5/3 while for ''d'' ≥ 4 the fractal dimension is 2. The dimension is called the upper [[critical dimension]] above which excluded volume is negligible.
| |
| | |
| The properties of SAWs cannot be calculated analytically, so numerical [[simulation]]s 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 a symmetry operation (rotations and reflections) on the walk after the nth 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 for determining the number of self-avoiding walks, although there are rigorous methods for approximating them.<ref>{{cite journal |author=Hayes B |title=How to Avoid Yourself |journal=American Scientist |volume=86 |issue=4 |pages= |date=Jul–Aug 1998 |url=http://www.americanscientist.org/issues/pub/how-to-avoid-yourself/}}</ref><ref>{{cite journal |author=Liśkiewicz M, Ogihara M, Toda S |title=The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes |journal=Theoretical Computer Science |volume=304 |issue=1–3 |pages=129–56 |date=July 2003 |doi=10.1016/S0304-3975(03)00080-X |url=http://linkinghub.elsevier.com/retrieve/pii/S030439750300080X}}</ref> Finding the number of such paths is [[mathematical conjecture|conjectured]] to be an [[NP-hard]] problem. For self-avoiding walks from one end of a diagonal to the other, with only moves in the positive direction, there are exactly <math>{m+n \choose m,n}</math> paths for an ''m'' × ''n'' rectangular lattice.
| |
| | |
| ==Universality==
| |
| One of the phenomena associated with self-avoiding walks and 2-dimensional 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 <math>c_n</math> 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 <math> c_{n+m} \leq c_n c_m </math>. Then by applying [[Fekete's lemma]] to the logarithm of the above relation, the limit <math>\mu = \lim_{n \rightarrow \infty} c_n^{1/n}</math> can be shown to exist. This number <math>\mu</math> is called the connective constant, and clearly depends on the particular lattice chosen for the walk since <math>c_n</math> does. The value of <math>\mu</math> is precisely known only for the hexagonal lattice, where it is equal to <math>\sqrt{2 + \sqrt{2}}</math> (a recent result from Duminil-Copin and Smirnov<ref>{{cite journal|author=H. Duminil-Copin|coauthors=S. Smirnov|title=The connective constant of the honeycomb lattice equals \sqrt{2+\sqrt2}|journal=arXiv preprint arXiv:1007.0575 (2010).|year=2010|url=http://arxiv.org/abs/1007.0575}}</ref> ). For other lattices, <math>\mu</math> has only been approximated numerically, and is believed to not even be an [[algebraic number]]. It is conjectured that <math>c_n \approx \mu^n n^{11/32}</math> as n goes to infinity, where <math>\mu</math> depends on the lattice, but the power law correction <math>n^{11/32}</math> does not; in other words, this law is believed to be universal.
| |
| | |
| ==Limits==
| |
| Consider the uniform measure on <math>n</math>-step self-avoiding walks in the full plane. It is currently unknown whether the limit of the uniform measure as <math>n</math> goes to infinity 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 <math>\kappa = 8/3</math>.
| |
| | |
| ==Self-avoiding walks in popular culture==
| |
| * The [[computer video game]] [[Snake (video game)|Snake]] is an example of a self-avoiding walk.
| |
| | |
| ==References==
| |
| {{reflist}}
| |
| | |
| ==Further reading==
| |
| <div class="references-small">
| |
| # {{cite book
| |
| | last = Madras | first = N.
| |
| | coauthors = Slade, G.
| |
| | year = 1996
| |
| | title = The Self-Avoiding Walk
| |
| | publisher = Birkhäuser
| |
| | isbn = 978-0-8176-3891-7
| |
| }}
| |
| # {{cite book
| |
| | last = Lawler | first = G. F.
| |
| | year = 1991
| |
| | title = Intersections of Random Walks
| |
| | publisher = Birkhäuser
| |
| | isbn = 978-0-8176-3892-4
| |
| }}
| |
| # {{cite journal
| |
| |author= Madras, N.; Sokal, A. D.
| |
| |year= 1988
| |
| |title= The pivot algorithm – A highly efficient Monte-Carlo method for the self-avoiding walk
| |
| |journal= Journal of Statistical Physics
| |
| |volume= 50
| |
| |issue=
| |
| |publisher=
| |
| |url=
| |
| }}
| |
| # {{cite journal
| |
| |author=Fisher, M. E.
| |
| |year= 1966
| |
| |title= Shape of a self-avoiding walk or polymer chain
| |
| |journal= Journal of Chemical Physics
| |
| |volume= 44
| |
| |issue= 2
| |
| |pages= 616
| |
| |publisher=
| |
| |url=
| |
| |bibcode=1966JChPh..44..616F
| |
| |doi=10.1063/1.1726734
| |
| }}
| |
| </div>
| |
| | |
| == External links ==
| |
| *{{OEIS2C|id=A007764}}: 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.
| |
| *{{MathWorld|urlname=Self-AvoidingWalk|title=Self-Avoiding Walk}}
| |
| *[http://polymer.bu.edu/java/java/saw/saw.html Java applet of a 2D self-avoiding walk]
| |
| | |
| {{Fractals}}
| |
| {{Stochastic processes}}
| |
| | |
| [[Category:Polygons]]
| |
| [[Category:Discrete geometry]]
| |
| [[Category:Computational physics]]
| |
| [[Category:Computational chemistry]]
| |
Hello, my title is Andrew and my wife doesn't like it at all. Invoicing is what I do for a living but I've usually needed my own business. My spouse and I reside in Mississippi and I love every working day residing here. To perform lacross is some thing I truly appreciate performing.
Here is my homepage - email psychic readings (http://ustanford.com/)