Random Graphs and Networks: A First Course - Alan Frieze, Michał Karoński

Random Graphs and Networks: A First Course

Buch | Hardcover
232 Seiten
2023
Cambridge University Press (Verlag)
978-1-009-26028-2 (ISBN)
93,50 inkl. MwSt
Based on the authors' own teaching experience, this text introduces random graphs and networks, covering all the basic features before discussing the growth and structure of real-world networks. It can be used as a textbook for a one-semester course at advanced undergraduate or graduate level.
Networks surround us, from social networks to protein–protein interaction networks within the cells of our bodies. The theory of random graphs provides a necessary framework for understanding their structure and development. This text provides an accessible introduction to this rapidly expanding subject. It covers all the basic features of random graphs – component structure, matchings and Hamilton cycles, connectivity and chromatic number – before discussing models of real-world networks, including intersection graphs, preferential attachment graphs and small-world models. Based on the authors' own teaching experience, it can be used as a textbook for a one-semester course on random graphs and networks at advanced undergraduate or graduate level. The text includes numerous exercises, with a particular focus on developing students' skills in asymptotic analysis. More challenging problems are accompanied by hints or suggestions for further reading.

Alan Frieze is Professor in the Department of Mathematical Sciences at Carnegie Mellon University. He has authored almost 400 publications in top journals and was a plenary speaker at the 2014 International Congress of Mathematicians. Michał Karoński is Professor Emeritus in the Faculty of Mathematics and Computer Science at Adam Mickiewicz University, where he founded the Discrete Mathematics group. He served as Editor-in-Chief of 'Random Structures and Algorithms' for thirty years.

Conventions/Notation; Part I. Preliminaries: 1. Introduction; 2. Basic tools; Part II. Erdos–Rényi–Gilbert Model: 3. Uniform and binomial random graphs; 4. Evolution; 5. Vertex degrees; 6. Connectivity; 7. Small subgraphs; 8. Large subgraphs; 9. Extreme characteristics; Part III. Modeling Complex Networks: 10. Inhomogeneous graphs; 11. Small world; 12. Network processes; 13. Intersection graphs; 14. Weighted graphs; References; Author index; Main index.

Erscheinungsdatum
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Maße 173 x 250 mm
Gewicht 610 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik
ISBN-10 1-009-26028-6 / 1009260286
ISBN-13 978-1-009-26028-2 / 9781009260282
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99