Paths: Why is Life Filled with So Many Detours?

简介:
这本开放获取的书探讨了人们所采取的路径与生活中许多其他事物之间的惊人相似性,以及它对我们生活,教学和学习方式的影响。作为网络科学的一部分,它提供了对路径新科学领域的见解,它有趣地描述了大型网络结构中路径的普遍性。它还显示了人类和其他甚至非生物在复杂环境中导航的方式的惊人相似性,使读者可以轻松掌握各行各业的路径以及它们的导航方式。它基于作者在网络路径领域的最新研究,该研究指出了 “路径” 新科学作为 “网络” 科学的自然结果 (和扩展) 的可能诞生。这种方法本质上是基于故事的,得到科学发现,跨学科方法,有时甚至是哲学观点的支持。它还包括简短的说明性轶事,展示了现实世界路径之间的惊人相似之处,并讨论了它们在科学和日常生活中的应用。它将吸引网络科学家和对大众科学感兴趣的任何人。通过帮助读者摆脱最近许多流行科学书籍的 “网络” 观点,并开始考虑更长的路径而不是单个链接,它从一个真正的新视角揭示了这些问题。
英文简介:
This open access book explores the amazing similarity between paths taken by people and many other things in life, and its impact on the way we live, teach and learn.
Offering insights into the new scientific field of paths as part of the science of networks, it entertainingly describes the universal nature of paths in large networked structures. It also shows the amazing similarity in the ways humans and other – even nonliving – things navigate in a complex environment, to allow readers to easily grasp how paths emerge in many walks of life, and how they are navigated.
It is based on the authors recent research in the area of paths on networks, which points to the possible birth of the new science of "paths" as a natural consequence (and extension) of the science of "networks."
The approach is essentially story-based, supported by scientific findings, interdisciplinary approaches, and at times, even philosophical points of view. It also includes short illustrative anecdotes showing the amazing similarities between real-world paths and discusses their applications in science and everyday life.
It will appeal to network scientists and to anyone interested in popular science. By helping readers to step away from the “networked” view of many recent popular scientific books and start to think of longer paths instead of individual links, it sheds light on these problems from a genuinely new perspective.
- 书名
- Paths: Why is Life Filled with So Many Detours?
- 译名
- 路:人生为何充满那么多弯路?
- 语言
- 英语
- 年份
- 2021
- 页数
- 97页
- 大小
- 4.22 MB
- 下载
Paths: Why is Life Filled with So Many Detours?.pdf
- 密码
- 65536
最后更新:2025-04-12 23:57:33
←OCaml Programming: Correct + Efficient + Beautiful
→Graphs for Pattern Recognition: Infeasible Systems of Linear Inequalitiesn