東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Large deviations for random graphs =...

Chatterjee, Sourav.

FindBook

Google Book

Amazon

博客來

Large deviations for random graphs = Ecole d'Ete de Probabilites de Saint-Flour XLV - 2015 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Large deviations for random graphs/ by Sourav Chatterjee.
其他題名:	Ecole d'Ete de Probabilites de Saint-Flour XLV - 2015 /
作者:	Chatterjee, Sourav.
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	xi, 170 p. :ill., digital ;24 cm.
內容註:	1. Introduction -- 2. Preparation -- 3. Basics of graph limit theory -- 4. Large deviation preliminaries -- 5. Large deviations for dense random graphs -- 6. Applications of dense graph large deviations -- 7. Exponential random graph models -- 8. Large deviations for sparse graphs -- Index.
Contained By:	Springer eBooks
標題:	Random graphs - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-65816-2
ISBN:	9783319658162

Large deviations for random graphs = Ecole d'Ete de Probabilites de Saint-Flour XLV - 2015 /
Chatterjee, Sourav.

Large deviations for random graphsEcole d'Ete de Probabilites de Saint-Flour XLV - 2015 /[electronic resource] :by Sourav Chatterjee. - Cham :Springer International Publishing :2017. - xi, 170 p. :ill., digital ;24 cm. - Lecture notes in mathematics,21970075-8434 ;. - Lecture notes in mathematics ;2197..

1. Introduction -- 2. Preparation -- 3. Basics of graph limit theory -- 4. Large deviation preliminaries -- 5. Large deviations for dense random graphs -- 6. Applications of dense graph large deviations -- 7. Exponential random graph models -- 8. Large deviations for sparse graphs -- Index.

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.

ISBN: 9783319658162

Standard No.: 10.1007/978-3-319-65816-2doiSubjects--Topical Terms:

1636138
Random graphs
--Congresses.

LC Class. No.: QA166.17

Dewey Class. No.: 511.5

Large deviations for random graphs = Ecole d'Ete de Probabilites de Saint-Flour XLV - 2015 /
LDR:02268nmm a2200337 a 4500 001 2109139
003 DE-He213
005 20180327165330.0
006 m d
007 cr nn 008maaau
008 180519s2017 gw s 0 eng d
020 $a 9783319658162 $q (electronic bk.)
020 $a 9783319658155 $q (paper)
024 7 $a 10.1007/978-3-319-65816-2 $2 doi
035 $a 978-3-319-65816-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.17
072 7 $a PBT $2 bicssc
072 7 $a PBWL $2 bicssc
072 7 $a MAT029000 $2 bisacsh
082 0 4 $a 511.5 $2 23
090 $a QA166.17 $b .C495 2017
100 1 $a Chatterjee, Sourav. $3 1908780
245 1 0 $a Large deviations for random graphs $h [electronic resource] : $b Ecole d'Ete de Probabilites de Saint-Flour XLV - 2015 / $c by Sourav Chatterjee.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xi, 170 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in mathematics, $x 0075-8434 ; $v 2197
505 0 $a 1. Introduction -- 2. Preparation -- 3. Basics of graph limit theory -- 4. Large deviation preliminaries -- 5. Large deviations for dense random graphs -- 6. Applications of dense graph large deviations -- 7. Exponential random graph models -- 8. Large deviations for sparse graphs -- Index.
520 $a 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.
650 0 $a Random graphs $x Congresses. $3 1636138
650 0 $a Large deviations $v Congresses. $3 3259195
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Probability Theory and Stochastic Processes. $3 891080
650 2 4 $a Combinatorics. $3 895617
710 2 $a SpringerLink (Online service) $3 836513
711 2 $a Ecole d'ete de probabilites de Saint-Flour $n (45th : $d 2015 : $c Saint-Flour, France) $3 3221994
773 0 $t Springer eBooks
830 0 $a Lecture notes in mathematics ; $v 2197. $3 3259194
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-65816-2
950 $a Mathematics and Statistics (Springer-11649)