Efficiently and quickly chewing through one trillion edges of a complex graph is no longer in itself a standalone achievement, but doing so on a single node, albeit with some acceleration and ...

Graphs are widely used to represent a wide variety of systems, ranging from the relationships between users of a social network to the payments among a network of bank accounts, and graph algorithms ...

Now imagine an ant that follows a different strategy: instead of visiting every node of the graph (as before), it now attempts to visit every edge of the graph exactly once. Sound familiar?

Lin's approach takes discrete graph paths as input, hence is explicitly modeling compositionality. This means it can offer the user an inference path which consists of the edges existing in the ...