The diameter of a random Cayley graph of Zq
Gideon Amir, Ori Gurel-Gurevich
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 q(1/k). The same also holds when the generating set is taken to be a symmetric set of size 2k.
Create a lesson
Related papers
Distribution-constrained optimal multiple stopping: the Root-type solution
Shuoqing Deng, Daxin Huang
Universality and sharp thresholds for ellipsoid fitting
Frederic Koehler, Youngtak Sohn
Local Laws and Edge Universality for Noncentral Sample Covariance Matrices
Can Hu, Jiang Hu, Zhidong Bai
Well-posedness and regularity of stochastic heat equations on moving domains
Chongyang Ren, Tusheng Zhang
Traveling Waves in Equity Markets with Rank-Based Entry and Exit
Graeme Baker, Caroline Smyth
An approximate zero bias transformation for random sums: Applications to sampling with outliers, auto insurance, and generative AI
Wasamon Jantai, Nathakhun Wiroonsri