Where The Walk Steps Next
A node2vec walk on an unweighted graph just moved from to . Node has exactly three neighbours:
| neighbour | shortest-path distance from |
|---|---|
| 0 | |
| 1 | |
| 2 |
The unnormalised transition weight is , equal to when the distance is 0, when it is 1, and when it is 2. With and , what is the probability that the walk's next step goes back to ?
Sign in to answer questions and track your progress
Sign In