The Curveball chain on regular graphs: spectral gap at most 2/n and a comparison with random transpositions

For the Curveball chain that performs a uniform trade at a uniformly chosen vertex pair of a d-regular graph on n vertices, we prove that 1-2/n is an eigenvalue for every n and d, so the spectral gap is at most 2/n and the relaxation time is at least n/2 trades. We prove that the chain dominates one half of the random-transposition walk on vertex labels, which bounds every eigenvalue outside two isotypic components and shows that the gap equals 2/n unless a smaller eigenvalue has an eigenfunction depending only on the rooted isomorphism class of the graph. The gap equals 2/n for d in {1,n-2} and, by an exact computer-assisted computation, for every regular degree sequence with n <= 11; equality for all n and d is open. The manuscript, its exact verification and the computer-assisted certificates were produced with AI assistance; the release includes written proofs, exact certificates and the ancillary programs.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24180368
Primary Topic
Markov Chains and Monte Carlo Methods
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Curveball chain on regular graphs: spectral gap at most 2/n and a comparison with random transpositions

Mark T. Short
2 links
Zenodo (CERN European Organization for Nuclear Research)
Markov Chains and Monte Carlo Methods
preprint

The Curveball chain on regular graphs: spectral gap at most 2/n and a comparison with random transpositions

Mark T. Short
preprint en

Abstract

For the Curveball chain that performs a uniform trade at a uniformly chosen vertex pair of a d-regular graph on n vertices, we prove that 1-2/n is an eigenvalue for every n and d, so the spectral gap is at most 2/n and the relaxation time is at least n/2 trades. We prove that the chain dominates one half of the random-transposition walk on vertex labels, which bounds every eigenvalue outside two isotypic components and shows that the gap equals 2/n unless a smaller eigenvalue has an eigenfunction depending only on the rooted isomorphism class of the graph. The gap equals 2/n for d in {1,n-2} and, by an exact computer-assisted computation, for every regular degree sequence with n <= 11; equality for all n and d is open. The manuscript, its exact verification and the computer-assisted certificates were produced with AI assistance; the release includes written proofs, exact certificates and the ancillary programs.

Zenodo (CERN European Organization for Nuclear Research)
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon