On Systematic Scan

• Main Author: Pedersen, Kasper
• Published: University of Liverpool 2008
• Subjects: 519
• Online Access: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491106

In this thesis westudy the mixing time of systematic scan Markov chains on finite spin systems. A systematic scan Markov chain is a IVlarkov chain which updates the sites in a deterministic order and this type of :Markov chain is often seen as intuitively appealing in terms of implementation to scientists conducting experimental work. Until recently systematic scan :~vlarkov chains have largely resisted analysis and a gap in the parameters that imply rapid mixing has developed between systematic scan Markov chains and the more frequently studied random update Markov chains. \Ve reduce this gap in this thesis by improving the parameters for which systematic scan mixes when applied to several well-known spin systems. The main contribution of this thesis is the introduction of a new technique for proving rapid mixing of systematic scan Markov chains. It is known that, in a single-site setting, the mixing time of systematic scan can be bounded in terms of the influence that sites have on each other. \Ve generalise this technique for bounding the mixing time of systematic scan to block dynamics, a setting in which a (constant size) set of sites are updated simultaneously. In particular we introduce a parameter corresponding to the maximum influence on any site and show that if this parameter is sufficiently small, then the corresponding systematic scan Markov chain mixes rapidly. \Ve present several applications of this new proof technique. In particular we show that systematic scan mixes rapidly on spin systems corresponding to proper q-colourings of (1) general graphs, (2) trees, and (3) the grid for improved parameters than were previously known. \Ve also obtain rapid mixing of systematic scan Markov chains for sampling H-colourings of the n-vertex path for a restricted family of H using this technique. The H-colouring result is extended to general graphs H by placing more restrictions on the scan and using path coupling, a well-established technique for bounding mixing times of ivlarkov chains. Path coupling is also used to prove rapid mixing of a single-site systematic scan for sampling proper q-colourings of bipartite graphs. Supplied by The British Library - 'The world's knowledge'