The diameter of a random Cayley graph of Zq
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.
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://research.microsoft.com/... (external link)