Traversing a triangulation using neighbourhood relationships is a common tool, for example just to perform point location in the triangulation or to route a message if the triangulation represents a communication network. Analyzing walking algorithms is a classic of computational geometry and in the worst case, many results have been obtained, and several problems remain open. In this talk, we will focus on the random case: what are the expected performance of some walking strategies ?