So for any u's ancestor v, the probability of v being u's leader is: where P(v, u) is the set of nodes between v and u on v-to-u path of repost tree, i.e., P(v, u) = {w ∈ V |w is v's descendant and u's ancestor on T }.
table 1 lists the features we use for leader detection.