The strange logic of random graphs
 |
|
Описание:
The study of random graphs was begun by Paul Erd?s and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often, there is a zero-one law that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The book will be of interest to graduate students and researchers in discrete mathematics.Похожие книги
 | The Grobner Annihilator Graph of a Ring Автор: Trevor McGuire Год: 2010 |
 | Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations Автор: Britanak V., Rao K. R., Yip P. C. Год: 2006 |
 | Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs Автор: Ahmed Shamsul Arefin Год: 2010 |
| Randomized techniques in combinatorial algorithms Автор: Zito M.A.A. Год: 1999 |
| Dynamic Graph Algorithms Автор: Eppstein D., Galil Z., Italiano F. |
| Threshold Graphs and Related Topics Автор: Peled U. N., Mahadev N. V. Год: 1995 |