数学和计算机
Social and Economic Networks 豆瓣 Goodreads
Social and Economic Networks
作者: Matthew O. Jackson 出版社: Princeton University Press 2008 - 9
Review
Lucid and comprehensive, Jackson's book elegantly synthesizes several important strands of network science from sociology, physics, mathematics, computer science, and economics. It will be an immensely useful reference for researchers and students alike.
(Duncan Watts, Columbia University )
Product Description
Networks of relationships help determine the careers that people choose, the jobs they obtain, the products they buy, and how they vote. The many aspects of our lives that are governed by social networks make it critical to understand how they impact behavior, which network structures are likely to emerge in a society, and why we organize ourselves as we do. In Social and Economic Networks, Matthew Jackson offers a comprehensive introduction to social and economic networks, drawing on the latest findings in economics, sociology, computer science, physics, and mathematics. He provides empirical background on networks and the regularities that they exhibit, and discusses random graph-based models and strategic models of network formation. He helps readers to understand behavior in networked societies, with a detailed analysis of learning and diffusion in networks, decision making by individuals who are influenced by their social neighbors, game theory and markets on networks, and a host of related subjects. Jackson also describes the varied statistical and modeling techniques used to analyze social networks. Each chapter includes exercises to aid students in their analysis of how networks function.
This book is an indispensable resource for students and researchers in economics, mathematics, physics, sociology, and business.
Randomized Algorithms 豆瓣
作者: Rajeev Motwani / Prabhakar Raghavan 出版社: Cambridge University Press 1995 - 8
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.