Random Walk on Complex Network and Application to Numerical Simulation for Statistical Physics
SZETO Kwok Yip
Classical random walk process has been studied for complex network that possesses short relaxation time. It is anticipated that generalization of the work by Lau and Szeto (EPL 2010) for multiple random walkers can be useful for various search algorithms. One possible application is to address the calculation of the density of states in statistical mechanics.
UROP1000 UROP1100 UROP2100 UROP3100 UROP4100
The applicant is expected to know how to do numerical simulation and has some background in statistical physics.
Applicant's Learning Objectives:
Data analysis and analytical calculation using mean field theory will be conducted.
1. To learn Monte Carlo simulation and the Wang Landau algorithm
2. To apply results on random walk on networks to these algorithms
Complexity of the project involves
1. Analytical work that may be difficult
2. Performance evaluation of new algorithms with existing ones for various applications in physics