Self-Avoiding Random Walks

In course

Pariatur exercitation ad consectetur irure officia tempor esse exercitation aliqua ex aliqua laboris qui sint. Eu voluptate ipsum do proident duis est. Veniam fugiat irure est nulla nostrud labore ex irure in aliqua quis proident. Proident adipisicing laboris consectetur id labore. Dolor aliqua sit deserunt minim Lorem labore incididunt cupidatat minim qui nostrud sit.

Description

This lecture covers the concept of self-avoiding random walks (SAW) and their mathematical models, discussing the avoidance of repeated steps and the development of closed polygons. The instructor explains the correlation function and the moments of SAW, emphasizing the importance of paths that are self-avoiding. The lecture concludes by exploring the vanishing of terms in the context of SAW and the significance of closed polygons in this mathematical model.

Instructor

officia amet

Est laborum consequat anim dolor aliquip proident sint incididunt qui laboris irure in. Eiusmod velit nisi cupidatat culpa eu do est id exercitation ad aliqua ut adipisicing occaecat. Laborum esse laborum in do proident enim dolor ea commodo esse proident.

Official source

https://mediaspace.epfl.ch/media/0_fpvc6bx3

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Geometry: Euclidean geometry

Related lectures (34)