Network Science: Analysis and Optimization Algorithms for Real-World Applications

Book Description

Network Science

Network Science offers comprehensive insight on network analysis and network optimization algorithms, with simple step-by-step guides and examples throughout, and a thorough introduction and history of network science, explaining the key concepts and the type of data needed for network analysis, ensuring a smooth learning experience for readers. It also includes a detailed introduction to multiple network optimization algorithms, including linear assignment, network flow and routing problems.

The text is comprised of five chapters, focusing on subgraphs, network analysis, network optimization, and includes a list of case studies, those of which include influence factors in telecommunications, fraud detection in taxpayers, identifying the viral effect in purchasing, finding optimal routes considering public transportation systems, among many others. This insightful book shows how to apply algorithms to solve complex problems in real-life scenarios and shows the math behind these algorithms, enabling readers to learn how to develop them and scrutinize the results.

Written by a highly qualified author with significant experience in the field, Network Science also includes information on:

• Sub-networks, covering connected components, bi-connected components, community detection, k-core decomposition, reach network, projection, nodes similarity and pattern matching
• Network centrality measures, covering degree, influence, clustering coefficient, closeness, betweenness, eigenvector, PageRank, hub and authority
• Network optimization, covering clique, cycle, linear assignment, minimum-cost network flow, maximum network flow problem, minimum cut, minimum spanning tree, path, shortest path, transitive closure, traveling salesman problem, vehicle routing problem and topological sort

With in-depth and authoritative coverage of the subject and many case studies to convey concepts clearly, Network Science is a helpful training resource for professional and industry workers in, telecommunications, insurance, retail, banking, healthcare, public sector, among others, plus as a supplementary reading for an introductory Network Science course for undergraduate students.

中文：

书名：网络科学: 用于实际应用的分析和优化算法

网络科学

网络科学提供了有关网络分析和网络优化算法的全面见解，并提供了简单的分步指南和示例，并全面介绍了网络科学的历史，解释了网络分析所需的关键概念和数据类型，确保了读者的顺利学习体验。它还包括对多种网络优化算法的详细介绍，包括线性分配，网络流量和路由问题。

本文由五章组成，重点是子图，网络分析，网络优化，并包括一系列案例研究，其中包括电信中的影响因素，纳税人的欺诈检测，识别购买中的病毒效应，寻找最佳路线考虑公共交通系统等。这本有见地的书展示了如何应用算法来解决现实场景中的复杂问题，并展示了这些算法背后的数学原理，使读者能够学习如何开发它们并仔细研究结果。

网络科学由一位在该领域具有丰富经验的高素质作者撰写，还包括以下信息:

• 子网络，覆盖互联组件，双联组件，社区检测，k核分解，到达网络，投影，节点相似度，模式匹配
• 网络中心性度量、覆盖程度、影响、聚类系数、贴近度、介值、特征向量、PageRank、集线器和权限
• 网络优化，覆盖集团，循环，线性分配，最小成本网络流量，最大网络流量问题，最小割，最小生成树，路径，最短路径，传递闭包，旅行商问题，车辆路由问题和拓扑排序

网络科学对该主题进行了深入和权威的报道，并通过许多案例研究清晰地传达了概念，是电信，保险，零售，银行，医疗保健，公共部门等专业和行业工作者的有用培训资源，另外，作为本科生网络科学入门课程的补充阅读。