³If there are no direct connections from 𝑢_𝑞 to nodes in 𝑉_𝑖 (𝑖 ≠ 𝑞), we first propagate probability to other nodes in 𝐺_𝑞 from 𝑢_𝑞 via breadth-first-search layer by layer until we reach a node which has cross-edges to nodes in 𝑉_𝑖 . Then we initialize x_𝑖 ⁽⁰⁾ = S_𝑞→𝑖 P_𝑞 ^𝑡 e_𝑞 , where 𝑡 is the number of hops that we first reach the effective node from 𝑢_𝑞 in 𝐺_𝑞 .