Random Graphs, Geometry and Asymptotic Structure

Michael Krivelevich

ISBN 10: 1316501914 / ISBN 13: 9781316501917

Edité par Cambridge University Press Apr 2016, 2016

A propos de cet article

Neuware - The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and probabilists. Moreover, the theory itself, even in its most basic forms, is often considered too advanced to be part of undergraduate curricula, and those who are interested usually learn it mostly through self-study, covering a lot of its fundamentals but little of the more recent developments. This book provides a self-contained and concise introduction to recent developments and techniques for classical problems in the theory of random graphs. Moreover, it covers geometric and topological aspects of the theory and introduces the reader to the diversity and depth of the methods that have been devised in this context.

N° de réf. du vendeur 9781316501917

Détails bibliographiques

• Titre: Random Graphs, Geometry and Asymptotic Structure
• Éditeur: Cambridge University Press Apr 2016
• Date de parution: 2016
• Langue: anglais
• ISBN à 10 chiffres: 1316501914
• ISBN à 13 chiffres: 9781316501917
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 226 L x 151 H x 10 P (en millimètres) 226 millimètres de largeur par 151 millimètres de hauteur par 10 millimètres de profondeur
• Poids: 194 grammes

A propos de ce titre

Synopsis

The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and probabilists. Moreover, the theory itself, even in its most basic forms, is often considered too advanced to be part of undergraduate curricula, and those who are interested usually learn it mostly through self-study, covering a lot of its fundamentals but little of the more recent developments. This book provides a self-contained and concise introduction to recent developments and techniques for classical problems in the theory of random graphs. Moreover, it covers geometric and topological aspects of the theory and introduces the reader to the diversity and depth of the methods that have been devised in this context.

À propos des auteurs

Professor Michael Krivelevich is a renowned expert on the theory of random graphs. He has written over 170 research papers, more than 100 of them in the last ten years. Most of his publications are on random graphs and related fields, such as extremal combinatorics, positional games theory and theoretical computer science.

Professor Konstantinos Panagiotou received the Richard Rado Prize in 2010. He is an expert on the relatively new theory of Boltzmann samplers and its relations to the study of random planar graphs as well as random graphs with constraints.

Professor Mathew Penrose is a leading expert on the theory of random geometric graphs. His research interests cover a variety of topics in modern probability theory, often motivated by questions from the physical sciences. These include interacting particle systems, percolation, stochastic analysis and extreme value theory.

Professor Colin McDiarmid is a leading expert on probabilistic combinatorics and discrete probability theory, with several participations in editorial boards of leading combinatorics journals. He has published over 80 papers on these areas. He is one of the pioneers of the theory of random planar graphs and random graphs with constraints.