Closeness Centrality • Understand the New Categories of Centralities That Includes Closeness Learning Centrality

Closeness Centrality • Understand the New Categories of Centralities That Includes Closeness Learning Centrality

Prof. Ralucca Gera, [email protected] Applied Mathematics Department, ExcellenceNaval Postgraduate Through Knowledge School MA4404 Complex Networks Closeness Centrality • Understand the new categories of centralities that includes closeness Learning centrality. Outcomes • Compute Closeness Centrality per node. • Interpret the meaning of the values of Closeness Centrality. Recall…back to Degree Centrality Quality: what makes a Mathematical Appropriate Usage Identification node important (central) Description Lots of one-hop The number of vertices Local influence Degree centrality (or connections from that influences directly matters simply the deg ) Small diameter Lots of one-hop The proportion of the Local influence Normalized degree connections from vertices that influences matters centrality relative to the size of the directly Small diameter deg graph |V(G)| In the “middle” of the HOW? graph How to measure it? Quality: what makes a Mathematical Appropriate Usage Identification node important (central) Description Lots of one-hop The number of vertices Local influence matters Degree centrality (or connections from that influences Small diameter simply the deg ) directly Lots of one-hop The proportion of the Local influence matters Normalized degree connections from relative vertices that Small diameter centrality to the size of the graph influences directly deg |V(G)| In the “middle” of the graph Close to everyone at The efficiency of a - closeness centrality the same time vertex of reaching 1, everyone quickly (spreading news or a virus for example) MA4404: Centralities categories Adjacencies Distances Degree Closeness Eigenvector Betweenness Katz HITS PageRank Intuition Closeness Centrality Why?! • What if it’s not so important to have many direct friends? • But one still wants to be in the “middle” of the network by being close to many friends. • What metric could identify these central nodes? • Graph theory: Cen(G) = {v : e(v) is the smallest of all vertices in G} • Complex networks: Closeness centrality centrality‐measures.png (942×564) (compjournalism.com) 7 Closeness centrality: definition Closeness is based on the average distance between a vertex i and all vertices in the graph (consider vertices in the same component only): 1, depends on inverse distance to other vertices Closeness centrality can be viewed as the efficiency of a vertex in spreading information to all other vertices. Drawback: only computed per component 8 Closeness centrality: definition Closeness centrality for node is the average distance between a vertex i and all vertices in the graph (consider vertices in the same component only): 1, which depends on inverse distance to other vertices Closeness centrality can be viewed as the efficiency of a vertex in spreading information to all other vertices. Drawback: only computed per component 9 Examples Closeness Centrality 1, 1 1 1 1 1 2 1 2 1 0.125 8 In class exercise: closeness centrality • What is the centrality of a vertex in ? • What is the centrality of a vertex in ? • What is the centrality of a vertex in ? • Should they be the same regardless of the n? Sometimes, we care for a relative centrality, so it should be the same for all n values, since it identifies a certain structure. • How would you fix the “problem” so that it scales with n? 1 ∑ , where n is number of vertices in the graph. • In class exercise: What is the normalized closeness centrality of a vertex in ? 12 Well Defined?! Closeness centrality • In a typical network the closeness centrality might span a factor of five or less • It is difficult to distinguish between central and less central vertices • a small change in network might considerably affect the centrality order • It is well defined?! Consider it in a disconnected network: 1, • Alternative computations exist but they have their own problems: • Such as the harmonic mean: ∑ , Which works for disconnected graphs since 0 if i and j are in , different components. But still small range of values for most networks. • Both closeness centrality and harmonic closeness centrality are hardly ever used 14 Generalization • How would you generalize this centrality? • This is a good time to share your thoughts • Closeness centrality of a set rather than a vertex? [PDF] Clustering memes in social media | Semantic Scholar 15.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    15 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us