The diameter of a random Cayley graph of ℤq

Gideon Amir; Ori Gurel-Gurevich

doi:10.1515/GCC.2010.004

The diameter of a random Cayley graph of ℤ_q

Gideon Amir^*, Ori Gurel-Gurevich

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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	English
Pages (from-to)	59-65
Number of pages	7
Journal	Groups, Complexity, Cryptology
Volume	2
Issue number	1
DOIs	https://doi.org/10.1515/GCC.2010.004
State	Published - Jun 2010
Externally published	Yes

Keywords

Random graphs
Random random walks

Access to Document

10.1515/GCC.2010.004

Cite this

@article{19cfc0412a0a405b89a14fa6bd0295a2,

title = "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 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.",

keywords = "Random graphs, Random random walks",

author = "Gideon Amir and Ori Gurel-Gurevich",

year = "2010",

month = jun,

doi = "10.1515/GCC.2010.004",

language = "אנגלית",

volume = "2",

pages = "59--65",

journal = "Groups, Complexity, Cryptology",

issn = "1867-1144",

publisher = "Episciences",

number = "1",

}

TY - JOUR

T1 - The diameter of a random Cayley graph of ℤq

AU - Amir, Gideon

AU - Gurel-Gurevich, Ori

PY - 2010/6

Y1 - 2010/6

N2 - 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.

AB - 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.

KW - Random graphs

KW - Random random walks

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

U2 - 10.1515/GCC.2010.004

DO - 10.1515/GCC.2010.004

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84858432197

SN - 1867-1144

VL - 2

SP - 59

EP - 65

JO - Groups, Complexity, Cryptology

JF - Groups, Complexity, Cryptology

IS - 1

ER -

The diameter of a random Cayley graph of ℤ_q

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this