Mixing times for neighbour transposition shuffles on graphs
Licentiatavhandling, 2011
lollipop graphs
random graphs
card shuffling
convergence rate of Markov chains
neighbour transpositions
mixing time
Pascal, Department of Mathematical Sciences, Chalmers Tvärgata 3, Chalmers University of Technology
Opponent: Dr. Jonas Sjöstrand, Department of Mathematics, KTH Royal Institute of Technology
Författare
Stefan Erikshed
Chalmers, Matematiska vetenskaper
Chalmers, Matematiska vetenskaper, Matematisk statistik
Göteborgs universitet
Fundament
Grundläggande vetenskaper
Ämneskategorier (SSIF 2011)
Annan matematik
Sannolikhetsteori och statistik
Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University: 2011:11
Pascal, Department of Mathematical Sciences, Chalmers Tvärgata 3, Chalmers University of Technology
Opponent: Dr. Jonas Sjöstrand, Department of Mathematics, KTH Royal Institute of Technology