Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.