Networks and Complexity
Autor Thilo Grossen Limba Engleză Hardback – 12 noi 2026
This open access textbook offers a modern, integrated introduction to complexity science. Taking perspectives from multiple disciplines and using network science as a unifying thread, it highlights both fundamental ideas and the bridges between them. At its core, the book is about understanding through method. Mathematical tools are developed through simple calculations, often accessible with pen and paper, and are consistently applied to real-world problems. Rather than presenting results in finished form, the text derives them constructively, explaining the reasoning that leads to them.
Refined through more than fifteen years of teaching across diverse audiences and continents, the book combines careful exposition with extensive worked examples and exercises. Its goal is not only to teach existing methods, but to equip readers to develop their own.
Preț: 457.85 lei
Precomandă
Puncte Express: 687
Carte nepublicată încă
Livrare prin curier în România Precomanda se expediază când titlul devine disponibil.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Specificații
ISBN-13: 9783032381125
ISBN-10: 3032381126
Pagini: 509
Ilustrații: VIII, 509 p. 111 illus., 94 illus. in color. With online files/update.
Dimensiuni: 178 x 254 mm
Editura: Springer Verlag GmbH
ISBN-10: 3032381126
Pagini: 509
Ilustrații: VIII, 509 p. 111 illus., 94 illus. in color. With online files/update.
Dimensiuni: 178 x 254 mm
Editura: Springer Verlag GmbH
Notă biografică
A physicist by training, Thilo Gross taught mathematics at the University of Bristol and computer science at UC Davis before becoming Professor of Biodiversity Theory at HIFMB Oldenburg. His research focuses on understanding how simplicity emerges in large, complex systems.
Cuprins
1 Kruskal's greedy algorithm.- 2 The shortest darkest path.- 3 Bridgewalk.- 4 Divide and Conquer.- 5 The small world.- 6 Friends of friends.- 7 Random graphs.- 8 A Curse of Cows.- 9 Massively-parallel maths.- 10 Attacks on Networks.- 11 All models are wrong.- 12 Growth of the scale-free networks.- 13 A secret of Bees.- 14 Tipping Points.- 15 The last great hunters.- 16 Outbreak.- 17 More is different.- 18 Laplace's Demon.- 19 The most important node.- 20 Complexity-Stability debate.- 21 Measuring the vibe of a city.- 22 Meta-ecosystems.- 23 No current without heat.- 24 One ring to rule them all?.- 25 Complexity.