| Patrick Doreian is a professor of sociology and statistics at the University of Pittsburgh and is chair of the Department of Sociology. He has edited the Journal of Mathematical Sociology since 1982 and has been a member of the editorial board for Social Networks since 2003. He was a Centennial Professor at The London School of Economics during 2002. He has been a Visiting Professor at the University of California-Irvine and the University of Ljubljana. His interests include social networks, mathematical sociology, interorganizational networks, environmental sociology and social movements. |
| Preface 1 Social Networks and Blockmodels 1.1 An Intuitive Statement of Network Ideas 1.1.1 Fundamental Types of Social Relations 1.1.2 Types of Relational Data Arrays 1.2 Blocks as Parts of Networks 1.2.1 Blocks 1.3 Some Block Types 1.4 Specifying Blockmodels 1.4.1 Parent-Child Role Systems 1.4.2 Organizational Hierarchies 1.4.3 Systems of Ranked Clusters 1.4.4 Baboon Grooming Networks 1.5 Conventional Blockmodeling 1.5.1 Equivalence and Blockmodeling 1.6 Generalized Blockmodeling 1.7 An Outline Map of the Topics Considered 2 Network Data Sets 2.1 Classic Data Sets 2.1.1 Sampson Monastery Data 2.1.2 Bank Wiring Room Data 2.1.3 Newcomb Fraternity Data 2.2 Newer Data Sets 2.2.1 Little League Baseball Teams 2.2.2 Political Actor Network 2.2.3 Student Government Data 2.2.4 Kansas Search and Rescue Network 2.2.5 A Bales-Type Group Dynamics Network 2.2.6 Ragusan Families Marriage Networks 2.2.7 Two Baboon Grooming Networks 2.3 Data Set Properties 2.4 Some Additional Remarks Concerning Data 3 Mathematical Prelude 3.1 Basic Set Theory 3.2 Relations 3.2.1 Operations with Binary Relations 3.2.2 Comparing Relations 3.2.3 Special Operations 3.3 Functions 3.3.1 Products of Functions 3.3.2 Relational Homomorphisms 3.4 Basic Algebra 3.5 Transitions to Chapters 4 and 9 4 Relations and Graphs for Network Analysis 4.1 Graphs 4.1.1 Examples of Graphs 4.1.2 Traveling on a Graph 4.1.3 Graph Coloring 4.2 Types of Binary Relations 4.2.1 Properties of Relations 4.2.2 Closures 4.2.3 Computing the Transitive Closure 4.2.4 Special Elements 4.2.5 Tournaments 4.3 Partitions and Equivalence Relations 4.4 Acyclic Relations 4.4.1 Levels 4.5 Orders 4.5.1 Factorization 4.5.2 Hasse Diagram 4.5.3 Numberings 4.6 Networks 4.7 Centrality in Networks 4.7.1 Algorithmic Aspects 4.8 Summary and Transition 5 Clustering Approaches 5.1 An Introduction to Cluster Analytic Ideas 5.2 Usual Clustering Problems 5.2.1 An Example 5.2.2 The Usual Steps of Solving Clustering Problems …… 6 An Optimizational Approach to Conventional Blockmodeling 7 Foundations for Generalized Blockmodeling 8 Blockmodeling Two-Mode Network Data 9 Semirings and Lattices 10 Balance Theory and Blockmodeling Signed Networks 11 Symmetric-Acyclic Blockmodels 12 Extending Generalized Blockmodeling Bibliography Author Index Subject Index |
内容加载中，请稍后...
商品评论（0条）