Answers are grounded in this paper and cite their sources.
We give a combinatorial proof of the following theorem. Let G be any finite group acting transitively on a set of cardinality n. If S ⊆ G is a random set of size k, with k ≥ (log n)1+ε for some ε >0, then the diameter of the corresponding Schreier graph is O(logₖ n) with high probability. Except for the implicit constant, this result is the best possible.
No takes yet. Share an insight, caveat, or question.
Dona et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: