In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

We consider a stochastic SIR (susceptible → infective → recovered) epidemic defined on a configuration model random graph, in which infective individuals can infect only their neighbours in the graph ...

The goal is to design a graph neural network based recommendation system for scroll paintings (folk art) that can run on decentralized compute environments (such as peer-to-peer systems). Requires ...