test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9458

Title: Sampling grid colourings with fewer colours
Authors: Molloy, M.
Achlioptas, D.
Moore, C.
Van Bussel, F.
Issue Date: 2004
Publisher: SPRINGER-VERLAG BERLIN
Citation: Achlioptas, D., Molloy, M., Moore, C., & Van Bussel, F. (2004). Sampling grid colorings with fewer colors. LATIN 2004: Theoretical Informatics [Lecture Notes In Computer Science] (pp. 80-89). BERLIN: SPRINGER-VERLAG BERLIN
Abstract: We provide an optimally mixing Markov chain for 6-colorings of the square grid. Furthermore, this implies that the uniform distribution on the set of such colorings has strong spatial mixing. Four and five are now the only remaining values of k for which it is not known whether there exists a rapidly mixing Markov chain for k-colorings of the square grid.
Description: http://www.springerlink.com/content/hxn3ubgp4q7yp51j/ The original publication can be found at www.springerlink.com
URI: http://hdl.handle.net/1807/9458
ISBN: 978-3-540-21258-4
Rights: IMPORTANT NOTICE: TO USERS OF THIS DATA ALL DATA WAS COLLECTED THROUGH THE CONSIDERABLE EFFORTS OF THE RESEARCHERS CONTRIBUTING TO IT. WHILE THE DATA CAN BE USED FOR NEW ANALYSES, Contact should be main to the collector of this data prior to publication and ACKNOWLEDGEMENT MUST BE EXPLICITLY MADE AS TO THE COLLECTOR AND CONTRIBUTOR OF THESE DATA.
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
sampling grid colourings.pdf239.73 kBAdobe PDF
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft