The diameter of random Cayley digraphs of given degree
Primo\v{z} Poto\v{c}nik, Jozef \v{S}ir\'a\v{n}, Jana \v{S}iagiov\'a,, Manuel E. Lladser, Mark C. Wilson

TL;DR
This paper studies the probability that a random Cayley digraph of a given degree has diameter two, revealing a sharp phase transition at a specific degree threshold as the size of the graph grows.
Contribution
It establishes the asymptotic probability and identifies a phase transition for the diameter of random Cayley digraphs based on the generating set size.
Findings
Probability approaches 1 when degree is linear in n
Sharp phase transition at degree around sqrt(n log n)
Exponential convergence to probability 1 for large degrees
Abstract
We consider random Cayley digraphs of order with uniformly distributed generating set of size . Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as and . We find a sharp phase transition from 0 to 1 at around . In particular, if is asymptotically linear in , the probability converges exponentially fast to 1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Limits and Structures in Graph Theory
