You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This collection of articles offers an excellent view on the state of combinatorics and related topics. A number of friends and colleagues, all top authorities in their fields of expertise have contributed their latest research papers to this volume.
This book addresses the emerging body of literature on the study of rare events in random graphs and networks. For example, what does a random graph look like if by chance it has far more triangles than expected? Until recently, probability theory offered no tools to help answer such questions. Important advances have been made in the last few years, employing tools from the newly developed theory of graph limits. This work represents the first book-length treatment of this area, while also exploring the related area of exponential random graphs. All required results from analysis, combinatorics, graph theory and classical large deviations theory are developed from scratch, making the text self-contained and doing away with the need to look up external references. Further, the book is written in a format and style that are accessible for beginning graduate students in mathematics and statistics.
This book constitutes the proceedings of the 13th International Workshop on Algorithms and Models for the Web Graph, WAW 2016, held in Montreal, QC, Canada, in December 2016. The 13 full papers presented in this volume were carefully reviewed and selected from 14 submissions. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.
Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. To develop a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as ``property testing'' in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact formulations and partial answers to very general questions, such as which problems in extremal graph ...
This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of László Lovász. The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization. László Lovász is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, “building bridges” between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years. The 14 contributions presented in this volume, all of which are connected to László Lovász's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.
The book presents the winners of the Abel Prize in mathematics for the period 2018–2022: - Robert P. Langlands (2018) - Karen K. Uhlenbeck (2019) - Hillel Furstenberg and Gregory Margulis (2020) - Lászlo Lóvász and Avi Wigderson (2021) - Dennis P. Sullivan (2022) The profiles feature autobiographical information as well as a scholarly description of each mathematician’s work. In addition, each profile contains a Curriculum Vitae, a complete bibliography, and the full citation from the prize committee. The book also includes photos from the period 2018–2022 showing many of the additional activities connected with the Abel Prize. This book follows on The Abel Prize: 2003–2007. The First Five Years (Springer, 2010) and The Abel Prize 2008–2012 (Springer, 2014) as well as on The Abel Prize 2013–2017 (Springer, 2019), which profile the previous Abel Prize laureates.
Records of meetings 1808-1916 in v. 11-27.
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdös, one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdös' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 900 pages, arranged into two volumes. These volumes contain both high level research articles as well as "key" articles which survey some of the cornerstones of Erdös' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdös complement this striking collection. A unique contribution is the bibliography on Erdös' publications: the most comprehensive ever published.