Introduction to Random Graphs - Alan Frieze, Michał Karoński

Introduction to Random Graphs

Buch | Hardcover
478 Seiten
2015
Cambridge University Press (Verlag)
978-1-107-11850-8 (ISBN)
75,95 inkl. MwSt
This book covers random graphs from the basic to the advanced and will appeal to anyone interested in combinatorics, applied probability or theoretical computer science. Having read this book, the reader should be in a good position to pursue research in the area.
From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a one semester course at the advanced undergraduate or beginning graduate level. The reader is then well prepared for the more advanced topics in Parts II and III. A final part provides a quick introduction to the background material needed. All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.

Alan Frieze is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pennsylvania. He has authored more than 300 publications in top journals and was invited to be a plenary speaker at the Seoul ICM 2014. In 1991 he received the Fulkerson prize in discrete mathematics. Michał Karoński is a founder of the Discrete Mathematics Research group at Adam Mickiewicz University in Poznan, Poland. He has authored over 50 publications and currently serves as co-Editor-in-Chief of Random Structures and Algorithms.

Preface; Part I. Basic Models: 1. Random graphs; 2. Evolution; 3. Vertex degrees; 4. Connectivity; 5. Small subgraphs; 6. Spanning subgraphs; 7. Extreme characteristics; 8. Extremal properties; Part II. Basic Model Extensions: 9. Inhomogeneous graphs; 10. Fixed degree sequence; 11. Intersection graphs; 12. Digraphs; 13. Hypergraphs; Part III. Other Models: 14. Trees; 15. Mappings; 16. k-out; 17. Real-world networks; 18. Weighted graphs; 19. Brief notes on uncovered topics; Part IV. Tools and Methods: 20. Moments; 21. Inequalities; 22. Differential equations method; 23. Branching processes; 24. Entropy; References; Author index; Main index.

Erscheint lt. Verlag 26.10.2015
Zusatzinfo Worked examples or Exercises; 1 Halftones, black and white; 24 Line drawings, black and white
Verlagsort Cambridge
Sprache englisch
Maße 156 x 235 mm
Gewicht 810 g
Themenwelt Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 1-107-11850-6 / 1107118506
ISBN-13 978-1-107-11850-8 / 9781107118508
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Begriffe, Sätze und zahlreiche Beispiele in kurzen Lerneinheiten

von Christian Karpfinger

Buch | Softcover (2022)
Springer Spektrum (Verlag)
54,99