This book contains a detailed and self-contained presentation of the replica theory of infinite range spin glasses. The authors also explain recent theoretical developments, paying particular attention to new applications in the study of optimization theory and neural networks. About two-thirds of the book are a collection of the most interesting and pedagogical articles on the subject.

About sixty years ago, the anomalous magnetic response of certain magnetic alloys drew the attention of theoretical physicists. It soon became clear that understanding these systems, now called spin glasses, would give rise to a new branch of statistical physics. As physical materials, spin glasses were found to be as useless as they were exotic. They have nevertheless been recognized as paradigmatic examples of complex systems with applications to problems as diverse as neural networks, amorphous solids, biological molecules, social and economic interactions, information theory and constraint satisfaction problems.This book presents an encyclopaedic overview of the broad range of these applications. More than 30 contributions are compiled, written by many of the leading researchers who have contributed to these developments over the last few decades. Some timely and cutting-edge applications are also discussed. This collection serves well as an introduction and summary of disordered and glassy systems for advanced undergraduates, graduate students and practitioners interested in the topic.

This book aims to describe in simple terms the new area of statistical mechanics known as spin-glasses, encompassing systems in which quenched disorder is the dominant factor. The book begins with a non-mathematical explanation of the problem, and the modern understanding of the physics of the spin-glass state is formulated in general terms. Next, the 'magic' of the replica symmetry breaking scheme is demonstrated and the physics behind it discussed. Recent experiments on real spin-glass materials are briefly described to demonstrate how this somewhat abstract physics can be studied in the laboratory. The final chapters of the book are devoted to statistical models of neural networks.The material here is self-contained and should be accessible to students with a basic knowledge of theoretical physics and statistical mechanics. It has been used for a one-term graduate lecture course at the Landau Institute for Theoretical Physics.

This superb new book is one of the first publications in recent years to provide a broad overview of this interdisciplinary field. Most of the book is written in a self contained manner, assuming only a general knowledge of statistical mechanics and basic probabilty theory . It provides the reader with a sound introduction to the field and to the analytical techniques necessary to follow its most recent developments

A very active field of research is emerging at the frontier of statistical physics, theoretical computer science/discrete mathematics, and coding/information theory. This book sets up a common language and pool of concepts, accessible to students and researchers from each of these fields.

This book serves as a concise introduction to the state-of-the-art of spin glass theory. The collection of review papers are written by leading experts in the field and cover the topic from a wide variety of angles. The book will be useful to both graduate students and young researchers, as well as to anyone curious to know what is going on in this exciting area of mathematical physics.

The celebrated Parisi solution of the Sherrington-Kirkpatrick model for spin glasses is one of the most important achievements in the field of disordered systems. Over the last three decades, through the efforts of theoretical physicists and mathematicians, the essential aspects of the Parisi solution were clarified and proved mathematically. The core ideas of the theory that emerged are the subject of this book, including the recent solution of the Parisi ultrametricity conjecture and a conceptually simple proof of the Parisi formula for the free energy. The treatment is self-contained and should be accessible to graduate students with a background in probability theory, with no prior knowledge of spin glasses. The methods involved in the analysis of the Sherrington-Kirkpatrick model also serve as a good illustration of such classical topics in probability as the Gaussian interpolation and concentration of measure, Poisson processes, and representation results for exchangeable arrays.

This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms.