BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Large Deviations for Random Graphs: École d'Été de Probabilités de Saint-Flour XLV - 2015

Large Deviations for Random Graphs: École d'Été de Probabilités de Saint-Flour XLV - 2015

Large Deviations for Random Graphs: École d'Été de Probabilités de
Stock photo: cover may vary

Large Deviations for Random Graphs: École d'Été de Probabilités de Saint-Flour XLV - 2015 Paperback - 2017

by Chatterjee, Sourav

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$166.50
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

  • Title Large Deviations for Random Graphs: École d'Été de Probabilités de Saint-Flour XLV - 2015
  • Author Chatterjee, Sourav
  • Binding Paperback
  • Condition Used - Good
  • Publisher Springer
  • Publication date 2017
  • Features Illustrated
  • Bookseller's Inventory # 3319658158.G
  • ISBN 9783319658155
  • Quantity available 1

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Large Deviations for Random Graphs: École d'Été de Probabilités de Saint-Flour XLV - 2015

From the publisher

First book-length treatment of large deviations for random graphs, plus a chapter on exponential random graphs

Contains a summary of important results from graph limit theory with complete proofs

Written in a style for beginning graduate students, self-contained with essentially no need for background knowledge other than some amount of graduate probability and analysis

From the rear cover

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.
tracking-