Graphs and Networks

Kingan, S. R.

  • 出版商: Wiley
  • 出版日期: 2022-05-03
  • 售價: $3,860
  • 貴賓價: 9.5$3,667
  • 語言: 英文
  • 頁數: 288
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 111893718X
  • ISBN-13: 9781118937181
  • 相關分類: Data Science機率統計學 Probability-and-statistics
  • 海外代購書籍(需單獨結帳)

商品描述

Graphs and Networks

A unique blend of graph theory and network science for mathematicians and data science professionals alike.

Featuring topics such as minors, connectomes, trees, distance, spectral graph theory, similarity, centrality, small-world networks, scale-free networks, graph algorithms, Eulerian circuits, Hamiltonian cycles, coloring, higher connectivity, planar graphs, flows, matchings, and coverings, Graphs and Networks contains modern applications for graph theorists and a host of useful theorems for network scientists.

The book begins with applications to biology and the social and political sciences and gradually takes a more theoretical direction toward graph structure theory and combinatorial optimization. A background in linear algebra, probability, and statistics provides the proper frame of reference.

Graphs and Networks also features:

  • Applications to neuroscience, climate science, and the social and political sciences
  • A research outlook integrated directly into the narrative with ideas for students interested in pursuing research projects at all levels
  • A large selection of primary and secondary sources for further reading
  • Historical notes that hint at the passion and excitement behind the discoveries
  • Practice problems that reinforce the concepts and encourage further investigation and independent work

商品描述(中文翻譯)

《圖論與網絡》

《圖論與網絡》是一本獨特的書籍,結合了圖論和網絡科學,適合數學家和數據科學專業人士閱讀。

本書涵蓋了諸如次圖、連接圖、樹、距離、譜圖理論、相似性、中心性、小世界網絡、無尺度網絡、圖算法、歐拉迴路、漢米爾頓迴路、著色、更高連通性、平面圖、流、匹配和覆蓋等主題,為圖論學家提供了現代應用和網絡科學家所需的一系列有用定理。

本書以生物學、社會科學和政治科學的應用為起點,逐漸轉向圖結構理論和組合優化的更為理論性的方向。讀者需要具備線性代數、概率論和統計學的基礎知識。

《圖論與網絡》還包括以下特點:

- 應用於神經科學、氣候科學以及社會科學和政治科學
- 研究展望直接融入敘述中,為有興趣從事研究項目的學生提供了思路
- 大量的一手和二手資料來源供進一步閱讀
- 提供歷史注解,暗示了發現背後的激情和興奮
- 練習問題強化概念,鼓勵進一步探索和獨立工作

作者簡介

S. R. Kingan is an Associate Professor of Mathematics at Brooklyn College and the Graduate Center of The City University of New York. Dr. Kingan's research interests include graph theory, matroid theory, combinatorial algorithms, and their applications.

作者簡介(中文翻譯)

S. R. Kingan 是紐約市立大學布魯克林學院和研究中心的數學副教授。Kingan博士的研究興趣包括圖論、矩陣理論、組合算法及其應用。