A measure of centrality based on Random Walks

Random walks is a combinatorial notion that works great as a model of the flow of information in a graph. It has several applications in many domains, the most visible one being page rank. In this talk I will go through the basics of random walks, present a notion of centrality based on them, and show some of its properties.