Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Measures of Centrality

    Uploaded by

    PRAGASM PROG
    This document discusses different measures of centrality in graph theory and network analysis. It introduces four main measures - degree, betweenness, closeness, and eigenvector centrality. Degree centrality is defined as the number of links to a node. Betweenness centrality quantifies the number of times a node acts as a bridge along the shortest path between two other nodes. Centralization is a measure of how central the most central node is compared to all other nodes in a network.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Measures of Centrality

    Uploaded by

    PRAGASM PROG
    37 views13 pages
    This document discusses different measures of centrality in graph theory and network analysis. It introduces four main measures - degree, betweenness, closeness, and eigenvector centrality. Degree centrality is defined as the number of links to a node. Betweenness centrality quantifies the number of times a node acts as a bridge along the shortest path between two other nodes. Centralization is a measure of how central the most central node is compared to all other nodes in a network.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses different measures of centrality in graph theory and network analysis. It introduces four main measures - degree, betweenness, closeness, and eigenvector centrality. Degree centrality is defined as the number of links to a node. Betweenness centrality quantifies the number of times a node acts as a bridge along the shortest path between two other nodes. Centralization is a measure of how central the most central node is compared to all other nodes in a network.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    37 views13 pages

    Measures of Centrality

    Uploaded by

    PRAGASM PROG
    This document discusses different measures of centrality in graph theory and network analysis. It introduces four main measures - degree, betweenness, closeness, and eigenvector centrality. Degree centrality is defined as the number of links to a node. Betweenness centrality quantifies the number of times a node acts as a bridge along the shortest path between two other nodes. Centralization is a measure of how central the most central node is compared to all other nodes in a network.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 13

    Measures of Centrality

    • In graph theory and network analysis, centrality of


    a vertex measures its relative importance within
    a graph.
    • Applications include how influential a person is within
    a social network, how important a room is within a
    building (space syntax), and how well-used a road is
    within an urban network.
    • There are four main measures of centrality: degree,
    betweenness, closeness, and eigenvector.
    • Centrality concepts were first developed in social
    network analysis, and many of the terms used to
    measure centrality reflect their sociological origin.
    Examples of A) 
    Degree centrality,
    B) Closeness centrality,
    C) Betweenness centrality,
    D) Eigenvector centrality,
    E) Katz centrality and F) Alpha
    centrality of the same graph.
    Degree centrality
    • Historically first and conceptually simplest is degree centrality, which
    is defined as the number of links incident upon a node (i.e., the
    number of ties that a node has).
    • The degree can be interpreted in terms of the immediate risk of a
    node for catching whatever is flowing through the network (such as a
    virus, or some information).
    • In the case of a directed network (where ties have direction), we
    usually define two separate measures of degree centrality,
    namely indegree and outdegree.
    • Accordingly, indegree is a count of the number of ties directed to the
    node and outdegree is the number of ties that the node directs to
    others.
    • When ties are associated to some positive aspects such as friendship
    or collaboration, indegree is often interpreted as a form of popularity,
    and outdegree as gregariousness.
    Betweenness centrality
    • Betweenness is a centrality measure of
    a vertex within a graph (there is
    also edgebetweenness, which is not discussed
    here).
    • Betweenness centrality quantifies the number
    of times a node acts as a bridge along the
    shortest path between two other nodes.
    Betweenness centrality
    • It was introduced as a measure for quantifying
    the control of a human on the communication
    between other humans in a social network
    by Linton Freeman.
    • In his conception, vertices that have a high
    probability to occur on a randomly
    chosen shortest path between two randomly
    chosen vertices have a high betweenness.
    Hue (from red=0 to blue=max)
    shows the node betweenness.
    Centralization
    • The centralization of any network is a
    measure of how central its most central node
    is in relation to how central all the other
    nodes are.
    • The general definition of centralization for
    non-weighted networks was proposed by
    Linton Freeman.
    Centralization
    • Centralization measures then
    – (a) calculate the sum in differences in centrality
    between the most central node in a network and
    all other nodes; and
    – (b) divide this quantity by the theoretically largest
    such sum of differences in any network of the
    same degree.
    –  Thus, every centrality measure can have its own
    centralization measure.

    You might also like