Random Graphs and Complex Networks - Remco van der Hofstad

Random Graphs and Complex Networks

Buch | Hardcover
236 Seiten
2016
Cambridge University Press (Verlag)
978-1-107-17287-6 (ISBN)
62,30 inkl. MwSt
Network science is one of the fastest growing areas in science and business. This classroom-tested, self-contained book is designed for master's-level courses and provides a rigorous treatment of random graph models for networks, featuring many examples of real-world networks for motivation and numerous exercises to build intuition and experience.
This rigorous introduction to network science presents random graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them. Classroom tested for over ten years, this text places recent advances in a unified framework to enable systematic study. Designed for a master's-level course, where students may only have a basic background in probability, the text covers such important preliminaries as convergence of random variables, probabilistic bounds, coupling, martingales, and branching processes. Building on this base - and motivated by many examples of real-world networks, including the Internet, collaboration networks, and the World Wide Web - it focuses on several important models for complex networks and investigates key properties, such as the connectivity of nodes. Numerous exercises allow students to develop intuition and experience in working with the models.

Remco van der Hofstad is Full Professor of Probability at Eindhoven University of Technology and Acting Scientific Director of the European Institute for Statistics, Probability, Stochastic Operations Research and their Applications (Eurandom). He has authored over 100 research articles and has taught courses on random graphs at over ten institutions. He received the 2003 Prix Henri Poincaré (jointly with Gordon Slade) and the 2007 Rollo Davidson Prize, and he is a laureate of the 2003 Innovative Research VIDI Scheme and the 2008 Innovative Research VICI Scheme.

Preface; Course outline; 1. Introduction; Part I. Preliminaries: 2. Probabilistics methods; 3. Branching processes; Part II. Basic Models: 4. Phase transition for the Erdos–Renyi random graph; 5. Erdos–Renyi random graph revisited; Part III. Models for Complex Networks: 6. Generalized random graphs; 7. Configuration model; 8. Preferential attachment models; Appendix; Glossary; References; Index.

Erscheinungsdatum
Reihe/Serie Cambridge Series in Statistical and Probabilistic Mathematics
Zusatzinfo 5 Tables, black and white; 58 Line drawings, black and white
Verlagsort Cambridge
Sprache englisch
Maße 184 x 262 mm
Gewicht 790 g
Themenwelt Mathematik / Informatik Informatik Netzwerke
Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Statistik
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
ISBN-10 1-107-17287-X / 110717287X
ISBN-13 978-1-107-17287-6 / 9781107172876
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99