Dynamic Graph Message Passing Networks

The neighbourhood used to update the feature representation of each node is predicted dynamically conditioned on each input. This is done by first uniformly sampling (denoted by "US") a set of S neighbourhoods around each node. -Walks are predicted (conditioned on the input) from these uniformly sampled nodes, denoted by the 𝒮 symbol representing the random walk sampling operation.