Seminar Details
2012-02-21 (14.00) : Random Walks on Networks: Dynamics and Teleportation
At Euler building
Organized by Mathematical Engineering
Speaker :
Lambiotte, Renaud
Abstract :
In this talk, I will focus on two problems related to random walks on networks. First, I will focus on random teleportation, which is a necessary evil for ranking and clustering directed networks based on random walks. Teleportation enables ergodic solutions, but the solutions must necessarily depend on the exact implementation and parametrization of the teleportation. For example, in the commonly used PageRank algorithm, the teleportation rate must trade off a heavily biased solution with a uniform solution. Here we show that teleportation to links rather than nodes enables a much smoother trade-off and effectively more robust results, and discuss the effect of teleportation on clustering. In the second part of my talk, I will focus on random walks on temporal networks, i.e. networks evolving in time. In particular, I will examine the effects of inter-event statistics on the dynamics of edges, and apply the concept of a generalized master equation to the study of continuous-time random walks on networks.