scispace - formally typeset

Katz centrality

About: Katz centrality is a(n) research topic. Over the lifetime, 601 publication(s) have been published within this topic receiving 77858 citation(s). more

More filters

Stanley Wasserman, Katherine Faust1Institutions (1)
25 Nov 1994-
TL;DR: This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of Dyadic and Triadic Interaction Models, which describes the relationships between actor and group measures and the structure of networks. more

Abstract: Part I. Introduction: Networks, Relations, and Structure: 1. Relations and networks in the social and behavioral sciences 2. Social network data: collection and application Part II. Mathematical Representations of Social Networks: 3. Notation 4. Graphs and matrixes Part III. Structural and Locational Properties: 5. Centrality, prestige, and related actor and group measures 6. Structural balance, clusterability, and transitivity 7. Cohesive subgroups 8. Affiliations, co-memberships, and overlapping subgroups Part IV. Roles and Positions: 9. Structural equivalence 10. Blockmodels 11. Relational algebras 12. Network positions and roles Part V. Dyadic and Triadic Methods: 13. Dyads 14. Triads Part VI. Statistical Dyadic Interaction Models: 15. Statistical analysis of single relational networks 16. Stochastic blockmodels and goodness-of-fit indices Part VII. Epilogue: 17. Future directions. more

17,092 citations

Journal ArticleDOI
Linton C. Freeman1Institutions (1)
01 Jan 1978-Social Networks
Abstract: The intuitive background for measures of structural centrality in social networks is reviewed and existing measures are evaluated in terms of their consistency with intuitions and their interpretability. Three distinct intuitive conceptions of centrality are uncovered and existing measures are refined to embody these conceptions. Three measures are developed for each concept, one absolute and one relative measure of the centrality of positions in a network, and one reflecting the degree of centralization of the entire network. The implications of these measures for the experimental study of small groups is examined. more

13,104 citations

Journal ArticleDOI
Linton C. Freeman1Institutions (1)
01 Mar 1977-
Abstract: A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced. These measures define centrality in terms of the degree to which a point falls on the shortest path between others and there fore has a potential for control of communication. They may be used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected. more

6,934 citations

Journal ArticleDOI
Abstract: 2In an influential paper, Freeman (1979) identified three aspects of centrality: betweenness, nearness, and degree. Perhaps because they are designed to apply to networks in which relations are binary valued (they exist or they do not), these types of centrality have not been used in interlocking directorate research, which has almost exclusively used formula (2) below to compute centrality. Conceptually, this measure, of which c(ot, 3) is a generalization, is closest to being a nearness measure when 3 is positive. In any case, there is no discrepancy between the measures for the four networks whose analysis forms the heart of this paper. The rank orderings by the more

4,073 citations

Journal ArticleDOI
Ulrik Brandes1Institutions (1)
TL;DR: New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links. more

Abstract: Motivated by the fast‐growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They require O(n + m) space and run in O(nm) and O(nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links. Experimental evidence is provided that this substantially increases the range of networks for which centrality analysis is feasible. The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require ?(n 3) time and ?(n 2) space, where n is the number of actors in the network. more

3,637 citations

Network Information
Related Topics (5)
Random graph

12.4K papers, 379.9K citations

73% related
Network science

4.1K papers, 252.9K citations

73% related
Hierarchical closeness

3 papers, 12 citations

72% related
Hierarchical network model

2.4K papers, 137.3K citations

72% related
Triadic closure

234 papers, 60.3K citations

71% related
No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

David A. Bader

7 papers, 49 citations

Ulrik Brandes

6 papers, 4.4K citations

Liaquat Hossain

6 papers, 537 citations

Francesca Arrigo

6 papers, 60 citations

Kathleen M. Carley

5 papers, 113 citations