content_image/312309.jpg
<img src='content_image/312309.jpg'>

a series of cycles, each of which visited every node on the graph exactly once. Each cycle was randomly generated starting from a node adjacent from the endpoint of the previous cycle. Graphs: We compared learning rates across 3 different graph topologies, each consisting of 15 nodes and 30 edges: a modular graph, a lattice graph, and a random graph (Fig.1C). Briefly, 

