## All posts

Hi! I really enjoyed the tutorial and wanted to try tackle the homework. I got stuck at part 3, especially the part regarding establishing new connections, and I wanted to check the solutions but I coulndt find any solution after part 1? The titles are clickable but no file is downloaded or accessed. Any help woulde be appreciated!

Kind regards!

1) For the case of shrinking steps, we have, step length ~ (lambda)^n with (lambda less than 1). Sor, for negative value of n, step length should approach infinity always, but in the plots shown in the video, P as a function of lambda goes to 0 as n tends to negative infinity. What is the reason behind that?

2) How, for the case d=0, the expression of rho becomes ln(t)?

## Subforums

- Introduce Yourself
- Class Announcements
- Study Groups and Meetups
- Technical Issues
- General Discussion
- Course Feedback
- Course Materials to Share
- Fundamentals of NetLogo
- Functions and Iterations
- Introduction to Differential Equations
- Ordinary Differential Equations
- Maximum Entropy Methods
- Random Walks
- Introduction to Information Theory
- Vector and Matrix Algebra
- Introduction to Renormalization
- Game Theory I • Static Games
- Game Theory II • Dynamic Games
- Fundamentals of Machine Learning
- Introduction to Computation Theory
- Fundamentals of NetLogo
- Lecture: Pandemics
- Lecture: Artificial Intelligence
- Lecture: Crime and Punishment
- Complexity-GAINs Curriculum
- Introduction to Open Science
- Journal Club
- IN DEVELOPMENT: Multicellularity Modules
- UCR Application Tutorial
- Lecture: What is Complexity?
- Agent-Based Models with Python: An Introduction to Mesa
- Lecture: Epistemological emergence