Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The diameter of a random Cayley graph of ℤ q

The diameter of a random Cayley graph of ℤ q 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 2 k . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

The diameter of a random Cayley graph of ℤ q

Loading next page...
 
/lp/de-gruyter/the-diameter-of-a-random-cayley-graph-of-q-kAsv87HoME
Publisher
de Gruyter
Copyright
Copyright © 2010 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc.2010.004
Publisher site
See Article on Publisher Site

Abstract

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 2 k .

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Jun 1, 2010

There are no references for this article.