Download or read book Mixing in Time and Space for Discrete Spin Systems written by Dror Weitz and published by . This book was released on 2004 with total page 380 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Mathematical Foundations of Computer Science 2007 written by Ludek Kucera and published by Springer Science & Business Media. This book was released on 2007-08-15 with total page 779 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks address all current aspects in theoretical computer science and its mathematical foundations.
Download or read book Phase Transitions in Spin Systems written by Linji Yang and published by . This book was released on 2013 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Spin systems are powerful mathematical models widely used and studied in Statistical Physics and Computer Science. This thesis focuses the study of spin systems on colorings and weighted independent sets (the hard-core model). In many spin systems, there exist phase transition phenomena: there is a threshold value of a parameter such that when the parameter is on one side of the threshold, the system exhibits the so-called spatial decay of correlation, i.e., the influence from a set of vertices to another set of vertices diminishes as the distance between the two sets grows; when the parameter is on the other side, long range correlations persist. The uniqueness problem and the reconstruction problem are two major threshold problems that are concerned with the decay of correlations in the Gibbs measure from different perspectives. In Computer Science, the study of spin systems mainly focused on finding an efficient algorithm that samples the configurations from a distribution that is very close to the Gibbs measure. Glauber dynamics is a typical Markov chain algorithm for performing sampling. In many systems, the convergence time of the Glauber dynamics also exhibits a threshold behavior: the speed of convergence experiences a dramatic change around the threshold of the parameter. The first two parts of this thesis focus on making connections between the phase transition of the convergence time of the dynamics and the phase transition of the reconstruction phenomenon in both colorings and the hard-core model on regular trees. A relatively sharp threshold is established for the change of the convergence time, which coincides with the reconstruction threshold. A general technique of upper bounding the conductance of the dynamics via analyzing the sensitivity of the reconstruction algorithm is proposed and proven to be very effective for lower bounding the convergence time of the dynamics. The third part of the thesis provides an innovative analytical method for establishing a strong version of the decay of correlation of the Gibbs distributions for many two spin systems on various classes of graphs. In particular, the method is applied to the hard-core model on the square lattice, a very important graph that is of great interest in both Statistical Physics and Computer Science. As a result, we significantly improve the lower bound of the uniqueness threshold on the square lattice and extend the range of parameter where the Glauber dynamics is rapidly mixing.
Download or read book Probability on Discrete Structures written by Harry Kesten and published by Springer Science & Business Media. This book was released on 2013-03-14 with total page 358 pages. Available in PDF, EPUB and Kindle. Book excerpt: Most probability problems involve random variables indexed by space and/or time. These problems almost always have a version in which space and/or time are taken to be discrete. This volume deals with areas in which the discrete version is more natural than the continuous one, perhaps even the only one than can be formulated without complicated constructions and machinery. The 5 papers of this volume discuss problems in which there has been significant progress in the last few years; they are motivated by, or have been developed in parallel with, statistical physics. They include questions about asymptotic shape for stochastic growth models and for random clusters; existence, location and properties of phase transitions; speed of convergence to equilibrium in Markov chains, and in particular for Markov chains based on models with a phase transition; cut-off phenomena for random walks. The articles can be read independently of each other. Their unifying theme is that of models built on discrete spaces or graphs. Such models are often easy to formulate. Correspondingly, the book requires comparatively little previous knowledge of the machinery of probability.
Download or read book Spatial and Temporal Mixing of Gibbs Measures written by Allan Murray Sly and published by . This book was released on 2009 with total page 440 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Randomization and Approximation Techniques in Computer Science written by Jose D.P. Rolim and published by Springer. This book was released on 2003-08-03 with total page 284 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002, held in Cambridge, MA, USA in September 2002. The 21 revised full papers presented were carefully reviewed and selected from 48 submissions. Among the topics addressed are coding, geometric computations, graph colorings, random hypergraphs, graph computations, lattice computations, proof systems, probabilistic algorithms, derandomization, constraint satisfaction, and web graphs analysis.
Download or read book Proceedings of the Thirty ninth Annual ACM Symposium on Theory of Computing written by ACM Special Interest Group for Algorithms and Computation Theory and published by . This book was released on 2007 with total page 740 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Automata Languages and Programming written by Javier Esparza and published by Springer. This book was released on 2014-06-11 with total page 1122 pages. Available in PDF, EPUB and Kindle. Book excerpt: This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.
Download or read book LATIN 2004 Theoretical Informatics written by Martin Farach-Colton and published by Springer Science & Business Media. This book was released on 2004-03-19 with total page 642 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S ̃ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before, we published a selection of the papers in a special issue of a prestigious journal. We received 178 submissions. Each paper was assigned to four program c- mittee members, and 59 papers were selected. This was 80% more than the previous record for the number of submissions. We feel lucky to have been able to build on the solid foundation provided by the increasingly successful previous LATINs. And we are very grateful for the tireless work of Pablo Mart ́ ?nez L ́ opez, the Local Arrangements Chair. Finally, we thank Springer-Verlag for publishing these proceedings in its LNCS series.
Download or read book FOCS 2004 written by and published by Institute of Electrical & Electronics Engineers(IEEE). This book was released on 2004 with total page 652 pages. Available in PDF, EPUB and Kindle. Book excerpt: Annotation The proceedings covers computational complexity, cryptography, parallel and distributed computing, machine learning, logic, coding theory, theoretical databases, information technology, networks, quantum computing, and much more.
Download or read book Markov Chains and Mixing Times written by David A. Levin and published by American Mathematical Soc.. This book was released on 2017-10-31 with total page 465 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is an introduction to the modern theory of Markov chains, whose goal is to determine the rate of convergence to the stationary distribution, as a function of state space size and geometry. This topic has important connections to combinatorics, statistical physics, and theoretical computer science. Many of the techniques presented originate in these disciplines. The central tools for estimating convergence times, including coupling, strong stationary times, and spectral methods, are developed. The authors discuss many examples, including card shuffling and the Ising model, from statistical mechanics, and present the connection of random walks to electrical networks and apply it to estimate hitting and cover times. The first edition has been used in courses in mathematics and computer science departments of numerous universities. The second edition features three new chapters (on monotone chains, the exclusion process, and stationary times) and also includes smaller additions and corrections throughout. Updated notes at the end of each chapter inform the reader of recent research developments.
Download or read book Dissertation Abstracts International written by and published by . This book was released on 2005 with total page 796 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Yet another way to obtain low temperature expansions for discrete spin systems written by Claus Vohwinkel and published by . This book was released on 1992 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The Nature of Computation written by Cristopher Moore and published by OUP Oxford. This book was released on 2011-08-11 with total page 1498 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.
Download or read book Proceedings of the Thirty eighth Annual ACM Symposium on Theory of Computing written by ACM Special Interest Group for Algorithms and Computation Theory and published by . This book was released on 2006 with total page 790 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Probability and Phase Transition written by G.R. Grimmett and published by Springer Science & Business Media. This book was released on 2013-04-17 with total page 334 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume describes the current state of knowledge of random spatial processes, particularly those arising in physics. The emphasis is on survey articles which describe areas of current interest to probabilists and physicists working on the probability theory of phase transition. Special attention is given to topics deserving further research. The principal contributions by leading researchers concern the mathematical theory of random walk, interacting particle systems, percolation, Ising and Potts models, spin glasses, cellular automata, quantum spin systems, and metastability. The level of presentation and review is particularly suitable for postgraduate and postdoctoral workers in mathematics and physics, and for advanced specialists in the probability theory of spatial disorder and phase transition.
Download or read book Yet Another Way to Obtain Low Temperature Expansions for Discrete Spin Systems written by C. Vohwinkel and published by . This book was released on 1992 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: