Networks and Complexity : DE

個数:
  • 予約

Networks and Complexity : DE

  • 現在予約受付中です。出版後の入荷・発送となります。
    重要:表示されている発売日は予定となり、発売が延期、中止、生産限定品で商品確保ができないなどの理由により、ご注文をお取消しさせていただく場合がございます。予めご了承ください。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版
  • 商品コード 9783032381125

Description

What are the most important events and developments in the recent or not so recent past? Climate change? Pandemics? The internet and mobile communications? Artificial intelligence, globalization, or biodiversity loss? Interestingly, all of these areas involve networks. Not because the underlying systems are necessarily networks, but because we can describe them as networks. Over the past decades, networks have emerged as a universal language that we use to design and analyze complex systems, and network science has created many bridges within complexity and to other disciplines.

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.

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.

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.