|
|
|||
|
||||
OverviewThe intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hard-constraint models, and slow mixing and phase transition have led to new results and perspectives. These connections can help in understanding typical behavior of combinatorial phenomena such as graph coloring and homomorphisms. Inspired by issues and intriguing new questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. These proceedings are the outgrowth of that meeting. This volume is intended for graduate students and research mathematicians interested in probabilistic graph theory and its applications. Full Product DetailsAuthor: Jaroslav Nesetril , P. WinklerPublisher: American Mathematical Society Imprint: American Mathematical Society Edition: illustrated edition Volume: No. 63 Weight: 0.595kg ISBN: 9780821835517ISBN 10: 0821835513 Pages: 193 Publication Date: 30 March 2004 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: To order Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |