scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Centrality in social networks conceptual clarification

01 Jan 1978-Social Networks (North-Holland)-Vol. 1, Iss: 3, pp 215-239
TL;DR: In this article, three distinct intuitive notions of centrality are uncovered and existing measures are refined to embody these conceptions, and the implications of these measures for the experimental study of small groups are examined.
About: This article is published in Social Networks.The article was published on 1978-01-01 and is currently open access. It has received 14757 citations till now. The article focuses on the topics: Katz centrality & Random walk closeness centrality.
Citations
More filters
Journal ArticleDOI
TL;DR: Construction of brain networks from connectivity data is discussed and the most commonly used network measures of structural and functional connectivity are described, which variously detect functional integration and segregation, quantify centrality of individual brain regions or pathways, and test resilience of networks to insult.

9,291 citations


Cites background from "Centrality in social networks conce..."

  • ...Many measures of centrality are based on the idea that central nodes participate in many short paths within a network, and consequently act as important controls of information flow (Freeman, 1978)....

    [...]

  • ...Betweenness centrality Betweenness centrality of node i (e.g., Freeman, 1978), bi = 1 n − 1ð Þ n − 2ð Þ P h; jaN h≠j;h≠i; j≠i; ρhj ið Þ ρhj ; where ρhj is the number of shortest paths between h and j, and ρhj (i) is the number of shortest paths between h and j that pass through i. Betweenness…...

    [...]

  • ...…k w j lw δmi ;mj : Directed modularity (Leicht and Newman, 2008), QY = 1l P i;jaN aij − kouti k in i l δmi ;mj : Measures of centrality Closeness centrality Closeness centrality of node i (e.g. Freeman, 1978), L−1i = n − 1P jaN;j≠idij : Weighted closeness centrality, Lwi −1 = n − 1P jaN; j≠i dwij ....

    [...]

01 Jan 2006
TL;DR: Platform-independent and open source igraph aims to satisfy all the requirements of a graph package while possibly remaining easy to use in interactive mode as well.
Abstract: There is no other package around that satisfies all the following requirements: •Ability to handle large graphs efficiently •Embeddable into higher level environments (like R [6] or Python [7]) •Ability to be used for quick prototyping of new algorithms (impossible with “click & play” interfaces) •Platform-independent and open source igraph aims to satisfy all these requirements while possibly remaining easy to use in interactive mode as well.

8,850 citations


Cites background from "Centrality in social networks conce..."

  • ...Centrality measures The following centrality measures [7] can be calculated: • degree • closeness • vertex and edge betweenness • eigenvector centrality • page rank [12]....

    [...]

Journal ArticleDOI
TL;DR: Powell et al. as mentioned in this paper developed a network approach to organizational learning and derive firm-level, longitudinal hypotheses that link research and development alliances, experience with managing interfirm relationships, network position, rates of growth, and portfolios of collaborative activities.
Abstract: This research was supported by grants provided to the first author by the Social and Behavioral Sciences Research Institute, University of Arizona, and the Aspen Institute Nonprofit Sector Research Fund and by grants to the second author by the College of Business and Public Administration, University of Arizona. We have benefited from productive exchanges with numerous audiences to whom portions of this paper have been presented: a session at the 1994 Academy of Management meetings, the Social Organization workshop at the University of Arizona, the Work, Organizations, and Markets workshop at the Harvard Sociology Department, the 1994 SCOR Winter Conference at Stanford University, and colloquia at the business schools at the University of Alberta, UC-Berkeley, Duke, and Emory, and the JFK School at Harvard. For detailed comments on an earlier draft, we are extremely grateful to Victoria Alexander, Ashish Arora, Maryellen Kelley, Peter Marsden, Charles Kadushin, Dick Nelson, Christine Oliver, Lori Rosenkopf, Michael Sobel, Bill Starbuck, Art Stinchcombe, and anonymous reviewers at ASQ. We thank Dina Okamoto for research assistance and Linda Pike for editorial guidance. Address correspondence to Walter W. Powell, Department of Sociology, University of Arizona, Tucson, AZ 85721. We argue in this paper that when the knowledge base of an industry is both complex and expanding and the sources of expertise are widely dispersed, the locus of innovation will be found in networks of learning, rather than in individual firms. The large-scale reliance on interorganizational collaborations in the biotechnology industry reflects a fundamental and pervasive concern with access to knowledge. We develop a network approach to organizational learning and derive firm-level, longitudinal hypotheses that link research and development alliances, experience with managing interfirm relationships, network position, rates of growth, and portfolios of collaborative activities. We test these hypotheses on a sample of dedicated biotechnology firms in the years 1990-1994. Results from pooled, within-firm, time series analyses support a learning view and have broad implications for future theoretical and empirical research on organizational networks and strategic alliances.*

8,249 citations

Book
30 Dec 1991
TL;DR: In this article, the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work, is described and discussed. But it is argued that the analysis of social networks is not a purely static process.
Abstract: This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued...

6,366 citations

Journal ArticleDOI
TL;DR: In this article, the relationships among the structural, relational, and cogni cation of a large multinational electronics company were examined using data collected from multiple respondents in all the business units of the company.
Abstract: Using data collected from multiple respondents in all the business units of a large multinational electronics company, we examined the relationships both among the structural, relational, and cogni...

5,621 citations

References
More filters
Journal ArticleDOI
01 Mar 1977
TL;DR: A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced in this paper, which 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.
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.

8,026 citations

Journal ArticleDOI
TL;DR: It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection.
Abstract: The concepts of the "center" and the "median vertex" of a graph are generalized to the "absolute center" and the "absolute median" of a weighted graph a graph with weights attached to its vertices as well as to its branches. These results are used to find the optimum location of a "switching center" in a communication network and to locate the best place to build a "police station" in a highway system. It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection. Procedures for finding these locations are given.

2,224 citations

Journal ArticleDOI

2,136 citations


"Centrality in social networks conce..." refers background in this paper

  • ...It has been expressed in one form or another by Bavelas (1950), Flament Centrality in social networks 227 (1963), Beauchamp (1965) and Sabidussi (1966)....

    [...]

  • ...Hakimi (1965) and Sabidussi (1966) made it completely general when they defined the most central point in a network as that with the minimum cost or time for communicating with all other points....

    [...]

  • ...Closeness-based measures of point centrality have been developed by Bavelas (1950), Beauchamp (1965), Sabidussi (1966), Moxley and Moxley (1974) and Rogers (1974)....

    [...]

  • ...Sabidussi (1966) showed that this conjecture was wrong, but did not provide an alternative interpretation....

    [...]

Journal ArticleDOI

1,874 citations


"Centrality in social networks conce..." refers background in this paper

  • ...According to Bavelas (1950), a non-central position is one that “must relay messages through . . . others”....

    [...]

  • ...It has been expressed in one form or another by Bavelas (1950), Flament Centrality in social networks 227 (1963), Beauchamp (1965) and Sabidussi (1966)....

    [...]

  • ...Closeness-based measures of point centrality have been developed by Bavelas (1950), Beauchamp (1965), Sabidussi (1966), Moxley and Moxley (1974) and Rogers (1974)....

    [...]

  • ...They were reported by Bavelas (1950) and Bavelas and Barrett (195 l), and were first described in detail by Leavitt (195 1)....

    [...]

Journal ArticleDOI

1,278 citations


"Centrality in social networks conce..." refers background in this paper

  • ...It is reflected in the papers by Leavitt (1951), Faucheux and Moscovici (1960), Mackenzie (1966a), Nieminen (1974) and Freeman (1977)....

    [...]