Random Graphs, Geometry and Asymptotic Structure

Michael Krivelevich · Konstantinos Panagiotou · Mathew Penrose · Colin McDiarmid

apr. 2016 · London Mathematical Society Student Texts Cartea 84 · Cambridge University Press

Carte electronică

129

Pagini

Evaluările și recenziile nu sunt verificate Află mai multe

Despre această carte electronică

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.

Despre autor

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.

Evaluează cartea electronică

Spune-ne ce crezi.

Informații despre lectură

Smartphone-uri și tablete

Instalează aplicația Cărți Google Play pentru Android și iPad/iPhone. Se sincronizează automat cu contul tău și poți să citești online sau offline de oriunde te afli.

Laptopuri și computere

Poți să asculți cărțile audio achiziționate pe Google Play folosind browserul web al computerului.

Dispozitive eReader și alte dispozitive

Ca să citești pe dispozitive pentru citit cărți electronice, cum ar fi eReaderul Kobo, trebuie să descarci un fișier și să îl transferi pe dispozitiv. Urmează instrucțiunile detaliate din Centrul de ajutor pentru a transfera fișiere pe dispozitivele eReader compatibile.

Raportează conținut ilegal