In this case, we explore the use of asymmetric weights using conditional probability.
we define weights as follows: w(a → p) := P (p|a) = P (p, a) P (a) Having defined the graph structure, next we explore algorithms that analyze graph centrality via random walks.