TY - JOUR

T1 - Random walks, bisections and gossiping in circulant graphs

AU - Mans, Bernard

AU - Shparlinski, Igor

PY - 2014/10

Y1 - 2014/10

N2 - Circulant graphs are regular graphs based on Cayley graphs defined on the Abelian group Zn. They are popular network topologies that arise in distributed computing. Using number theoretical tools, we first prove two main results for random directed k-regular circulant graphs with n vertices, when n is sufficiently large and k is fixed. First, for any fixed ε>0, n=p prime and L≥p 1/k (logp)1+1/k+ε, walks of length at most L terminate at every vertex with asymptotically the same probability. Second, for any n, there is a polynomial time algorithm that for almost all undirected 2r-regular circulant graphs finds a vertex bisector and an edge bisector, both of size less than n 1-1/r+o(1). We then prove that the latter result also holds for all (rather than for almost all) 2r-regular circulant graphs with n=p, prime, vertices, while, in general, it does not hold for composite n. Using the bisection results, we provide lower bounds on the number of rounds required by any gossiping algorithms for any n. We introduce generic distributed algorithms to solve the gossip problem in any circulant graphs. We illustrate the efficiency of these algorithms by giving nearly matching upper bounds of the number of rounds required by these algorithms in the vertex-disjoint and the edge-disjoint paths communication models in particular circulant graphs.

AB - Circulant graphs are regular graphs based on Cayley graphs defined on the Abelian group Zn. They are popular network topologies that arise in distributed computing. Using number theoretical tools, we first prove two main results for random directed k-regular circulant graphs with n vertices, when n is sufficiently large and k is fixed. First, for any fixed ε>0, n=p prime and L≥p 1/k (logp)1+1/k+ε, walks of length at most L terminate at every vertex with asymptotically the same probability. Second, for any n, there is a polynomial time algorithm that for almost all undirected 2r-regular circulant graphs finds a vertex bisector and an edge bisector, both of size less than n 1-1/r+o(1). We then prove that the latter result also holds for all (rather than for almost all) 2r-regular circulant graphs with n=p, prime, vertices, while, in general, it does not hold for composite n. Using the bisection results, we provide lower bounds on the number of rounds required by any gossiping algorithms for any n. We introduce generic distributed algorithms to solve the gossip problem in any circulant graphs. We illustrate the efficiency of these algorithms by giving nearly matching upper bounds of the number of rounds required by these algorithms in the vertex-disjoint and the edge-disjoint paths communication models in particular circulant graphs.

UR - http://www.scopus.com/inward/record.url?scp=84905574967&partnerID=8YFLogxK

U2 - 10.1007/s00453-013-9810-3

DO - 10.1007/s00453-013-9810-3

M3 - Article

AN - SCOPUS:84905574967

VL - 70

SP - 301

EP - 325

JO - Algorithmica (New York)

JF - Algorithmica (New York)

SN - 0178-4617

IS - 2

ER -