| eBook ISBN: | 978-1-4704-0113-9 |
| Product Code: | MEMO/111/534.E |
| List Price: | $39.00 |
| MAA Member Price: | $35.10 |
| AMS Member Price: | $23.40 |
| eBook ISBN: | 978-1-4704-0113-9 |
| Product Code: | MEMO/111/534.E |
| List Price: | $39.00 |
| MAA Member Price: | $35.10 |
| AMS Member Price: | $23.40 |
-
Book DetailsMemoirs of the American Mathematical SocietyVolume: 111; 1994; 78 ppMSC: Primary 05; Secondary 60
This book develops a method to obtain limit theorems for various functionals of random graphs. The method is based on a certain orthogonal decomposition. Janson's results include limit theorems for the two standard random graph models, \(G_{n,p}\) and \(G_{n,m}\), as well as functional limit theorems for the evolution of a random graph and results on the maximum of a function during the evolution. Janson obtains both normal and nonnormal limits, and the method provides an explanation for the appearance of nonnormal limits. Applications to subgraph counts and to vertex degrees are presented as examples.
ReadershipResearchers in random graph theory and related fields. Possibly including some theoretical computer scientists.
-
Table of Contents
-
Chapters
-
I. Foundations
-
II. Limit theorems
-
III. Examples
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
This book develops a method to obtain limit theorems for various functionals of random graphs. The method is based on a certain orthogonal decomposition. Janson's results include limit theorems for the two standard random graph models, \(G_{n,p}\) and \(G_{n,m}\), as well as functional limit theorems for the evolution of a random graph and results on the maximum of a function during the evolution. Janson obtains both normal and nonnormal limits, and the method provides an explanation for the appearance of nonnormal limits. Applications to subgraph counts and to vertex degrees are presented as examples.
Researchers in random graph theory and related fields. Possibly including some theoretical computer scientists.
-
Chapters
-
I. Foundations
-
II. Limit theorems
-
III. Examples
