About: Self-avoiding walk

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Self-avoiding walk Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatPolygons, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSelf-avoiding_walk

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.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Attribute100024264 yago:Figure113862780 yago:PlaneFigure113863186 yago:Polygon113866144 yago:Shape100027807 yago:WikicatPolygons
rdfs:label	Selbstmeidender Pfad (de) Camino autoevitante (es) Chemin auto-évitant (fr) Self-avoiding walk (en) Caminho autoevitante (pt) Caminhada autoexcludente (pt) 自避行走 (zh)
rdfs:comment	在数学中，自避行走（简称：SAW，Self-Avoiding Walk）是一种格点上的随机漫步，但是不会多次访问同一点。所以SAW不是一种马尔可夫链。SAW模型在物理学、化学、生物学中有很多应用。 (zh) In der mathematischen Theorie der Irrfahrten sind selbstmeidende Pfade Wege auf einem Gitter, die nie zu einem bereits zuvor besuchten Punkt zurückkehren. Selbstmeidende Pfade sind das einfachste mathematische Modell für die Anordnung langer Polymerketten. (de) Un camino auto-evitado, o self-avoiding walk (SAW), es un camino que une dos puntos en un grafo plano con la condición de que no pasa por el mismo punto más de una vez. En particular, se pueden considerar caminos sobre la rejilla cuadrada 2-dimensional formada por los puntos en cuyas componentes son enteras. Un SAW es por lo tanto un camino de longitud que recorre las aristas de la rejilla sin interceptarse consigo mismo. En el estudio de estos caminos surgen dos preguntas fundamentales: (es) En mathématiques, un chemin auto-évitant (CAE), ou marche auto-évitante, est un chemin dans un réseau ne passant jamais par le même sommet ; lorsqu'il est fermé, on parle de polygone auto-évitant (PAE). Pour le graphe infini associé au réseau, les notions de CAE et de PAE correspondent à celles de chaînes et de cycles. (fr) 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. (en) Em matemática, um caminho autoevitante é uma sequência de movimentos em um retículo que não visita o mesmo ponto mais de uma vez. Este é um caso especial da noção de caminho da teoria dos grafos. Um polígono autoevitante é um caminho autoevitante fechado em um retículo. O termo caminho autoevitante foi introduzido pelo químico Paul Flory, a fim de modelar o comportamento real de entidades de configuração em cadeia, tais como solventes e polímeros, cujos volumes físicos proíbem múltiplas ocupações do mesmo ponto espacial. Muito pouco é conhecido rigorosamente a respeito dos caminhos auto-evitantes a partir de uma perspectiva matemática, apesar de que físicos terem provido numerosas conjecturas que são acreditadas serem verdade e fortemente apoiadas por simulações matemáticas, e que existam (pt)
foaf:depiction
dcterms:subject	Polygons Variants of random walks Discrete geometry Computational physics Computational chemistry
Wikipage page ID	11186496 (xsd:integer)
Wikipage revision ID	1100491912 (xsd:integer)
Link from a Wikipage to another Wikipage	Polygons Paul Flory Mathematics Measure theory Network theory Variants of random walks Connective constant Critical dimension Critical phenomena Erdős–Rényi model Discrete geometry Computational physics Computational problem Path (graph theory) Symmetry Topology Lattice (group) Algebraic number Fractal dimension Computational physics Fractal Gompertz distribution Graph theory Knight's tour Knot theory Protein Hamiltonian path Harry Kesten Snake (video game genre) Computational chemistry Lattice path Diamond cubic Polymer Random walk Sequence Markov chain Monte Carlo Schramm–Loewner evolution Simulation Solvent Universality (dynamical systems) Excluded volume Scaling limit Subadditivity Surface growth Fekete's lemma dbr:Pivot_algorithm
Link from a Wikipage to an external page	http://polymer.bu.edu/java/java/saw/saw.html https://github.com/abucksch/FiberWalk http://www.sas.upenn.edu/~vnanda/software.html
sameAs	Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk Self-avoiding walk
dbp:wikiPageUsesTemplate	dbt:Fractals dbt:= dbt:Cite_book dbt:Cite_journal dbt:Dubious dbt:Math dbt:MathWorld dbt:Mvar dbt:OEIS_el dbt:Refbegin

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software