Random Walks over Inifinite Graphs in Different Dimensions and Recurrence Study seen as Markov Chains

Abstract

This is the report of a final project for the subject Technomathematics Workshop taught by David Gomez Castro at the Complutense University of Madrid. Algorithms for the simulation of random walks on different infinite graphs are proposed and after that, the study of its recurrence.

Content

• Read the full project here.
• You cand find here all the code used.
• There are also some cool plots.

Author

Antonio Sevilla Sastre

---

You may check my other projects and follow me on LinkedIn!

---