## Abstract

Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators. For fixed k, we prove that the diameter of said graph is asymptotically (in q) of order k√q. This answers a question of Benjamini. The same also holds when the generating set is taken to be a symmetric set of size 2k.

Original language | American English |
---|---|

Pages (from-to) | 59-65 |

Number of pages | 7 |

Journal | Groups, Complexity, Cryptology |

Volume | 2 |

Issue number | 1 |

DOIs | |

State | Published - Jun 2010 |

Externally published | Yes |

## Keywords

- Random graphs
- Random random walks

## Fingerprint

Dive into the research topics of 'The diameter of a random Cayley graph of ℤ_{q}'. Together they form a unique fingerprint.