Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Self-avoiding_walk> ?p ?o. }

• Self-avoiding_walk abstract "In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a 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 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 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 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 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 m × n rectangular lattice.".
• Self-avoiding_walk thumbnail Self_avoiding_walk.svg?width=300.
• Self-avoiding_walk wikiPageExternalLink saw.html.
• Self-avoiding_walk wikiPageID "11186496".
• Self-avoiding_walk wikiPageRevisionID "596896379".
• Self-avoiding_walk hasPhotoCollection Self-avoiding_walk.
• Self-avoiding_walk title "Self-Avoiding Walk".
• Self-avoiding_walk urlname "Self-AvoidingWalk".
• Self-avoiding_walk subject Category:Computational_chemistry.
• Self-avoiding_walk subject Category:Computational_physics.
• Self-avoiding_walk subject Category:Discrete_geometry.
• Self-avoiding_walk subject Category:Polygons.
• Self-avoiding_walk type Abstraction100002137.
• Self-avoiding_walk type Attribute100024264.
• Self-avoiding_walk type Figure113862780.
• Self-avoiding_walk type PlaneFigure113863186.
• Self-avoiding_walk type Polygon113866144.
• Self-avoiding_walk type Polygons.
• Self-avoiding_walk type Shape100027807.
• Self-avoiding_walk comment "In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a 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 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.".
• Self-avoiding_walk label "Caminho autoevitante".
• Self-avoiding_walk label "Self-avoiding walk".
• Self-avoiding_walk sameAs Caminho_autoevitante.
• Self-avoiding_walk sameAs m.02r2zkk.
• Self-avoiding_walk sameAs Q7448025.
• Self-avoiding_walk sameAs Q7448025.
• Self-avoiding_walk sameAs Self-avoiding_walk.
• Self-avoiding_walk wasDerivedFrom Self-avoiding_walk?oldid=596896379.
• Self-avoiding_walk depiction Self_avoiding_walk.svg.
• Self-avoiding_walk isPrimaryTopicOf Self-avoiding_walk.