Showing a limited preview of this publication:
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 . This answers a question of Benjamini.
The same also holds when the generating set is taken to be a symmetric set of size 2k.
Keywords.: Random random walks; random graphs
Received: 2009-07-29
Published Online: 2010-06-23
Published in Print: 2010-June
© de Gruyter 2010