|
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. SAWs were first introduced by the chemist Paul Flory 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. 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 or 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 topological and knot-theoretic behaviour of thread- and loop-like molecules such as proteins. SAW is a fractal. For example, in the fractal dimension is , for it is close to while for the fractal dimension is . 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. 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 -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. Finding the number of such paths is 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 : paths for an rectangular lattice. ==Universality== One of the phenomena associated with self-avoiding walks and -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 denote the number of -step self-avoiding walks. Since every -step self avoiding walk can be decomposed into an -step self-avoiding walk and an -step self-avoiding walk, it follows that . Therefore the sequence is subadditive and we can apply Fekete's lemma to show that the following limit exists: : is called the connective constant, since 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:〔This is a recent result from Duminil-Copin and Smirnov: 〕 : as , where depends on the lattice, but the power law correction does not; in other words, this law is believed to be universal. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Self-avoiding walk」の詳細全文を読む スポンサード リンク
|