Random Walks, Bisections and Gossiping in Circulant Graphs
Circulant graphs are regular graphs based on Cayley graphs defined on the Abelian group \(\mathbb{Z}_{n}\). They are popular network topologies that arise in distributed computing.
random walks bisection gossiping circulant graphs random graphs