Elsevier

Social Networks

Volume 13, Issue 2, June 1991, Pages 141-154
Social Networks

Centrality in valued graphs: A measure of betweenness based on network flow

https://doi.org/10.1016/0378-8733(91)90017-NGet rights and content

Abstract

A new measure of centrality, CF, is introduced. It is based on the concept of network flows. While conceptually similar to Freeman's original measure, CB, the new measure differs from the original in two important ways. First, CF is defined for both valued and non-valued graphs. This makes CF applicable to a wider variety of network datasets. Second, the computation of CF is not based on geodesic paths as is CB but on all the independent paths between all pairs of points in the network.

References (51)

  • Phillip Bonacich

    Factoring and weighting approaches to status scores and clique identification

    Journal of Mathematical Sociology

    (1972)
  • Phillip Bonacich

    Power and centrality: A family of measures

    American Journal of Sociology

    (1987)
  • Ronald S. Burt

    Toward a Structural Theory of Action

    (1982)
  • B.S. Cohn et al.

    Networks and centres of integration in Indian civilization

    Journal of Social Research

    (1958)
  • James S. Coleman

    The Mathematics of Collective Action

    (1973)
  • J.A. Czepiel

    Word of mouth processes in the diffusion of a major technological innovation

    Journal of Marketing Research

    (1974)
  • E.A. Dinic

    Algorithm for the solution of a problem of maximum flow in a network with power estimation

    Soviet Math. Dokl.

    (1970)
  • Patrick Doreian

    A note on the detection of cliques in valued graphs

    Sociometry

    (1969)
  • C. Faucheux et al.

    Etudes sur la créativité des groupes tâches, structures des communications et performances des groupes

    Bulletin du C.E.R.P.

    (1960)
  • Leon Festinger

    The analysis of sociograms using matrix algebra

    Human Relations

    (1949)
  • L.R. Ford et al.

    Maximal flow through a network

    Canada Journal of Mathematics

    (1956)
  • L.R. Ford et al.

    A simple algorithm for finding maximal network flows and an application to the Hitchcock problem

    Canada Journal of Mathematics

    (1957)
  • L.R. Ford et al.

    Flows in Networks

    (1962)
  • Linton C. Freeman

    A set of measures of centrality based on betweenness

    Sociometry

    (1977)
  • Noah E. Friedkin

    Theoretical foundations for centrality measures

    American Journal of Sociology

    (1991)
  • Cited by (824)

    View all citing articles on Scopus
    View full text