Word maps, random permutations and random graphs
CASSIDY, EWAN GEORGE
(2025)
Word maps, random permutations and random graphs.
Doctoral thesis, Durham University.
The aim of this thesis is to study word maps on the symmetric group, with applications in the study of spectral properties of random regular graphs. We establish that, if is not a proper power, then
as
, where
is any stable irreducible character of
. We use this to prove that random sequences of representations of
that factor through non--trivial irreducible representations of
converge strongly to the left regular representation
, for any non--trivial irreducible representation of dimension
. An immediate consequence is that a random
--regular Schreier graph depicting the action of
random permutations on
--tuples of distinct elements in
has a near optimal spectral gap, with probability
as
.
| Item Type | Thesis (Doctoral) |
|---|---|
| Divisions | Faculty of Science > Mathematical Sciences, Department of |
| Date Deposited | 16 Sep 2025 12:46 |
| Last Modified | 16 Mar 2026 18:37 |
-
picture_as_pdf - THESISCorrected.pdf
-
subject - Accepted Version
Share this file