Answers.Body: <p>First, I'll observe that Freeman centrality as you define it is the reciprocal of the Barycenter centrality as you define. It looks like people often use the reciprocal instead of the original definition, so in that sense they do look the same.</p>
  <p>I found the following comparison <a href="https://rdrr.io/cran/centiserve/man/barycenter.html" rel="nofollow noreferrer">here</a> (though it doesn't name it as Freeman):</p>
  <blockquote>
  <p>There are 2 types of distance centrality scores, Closeness Centrality
  and Barycenter Centrality. Barycenter Centrality for vertex v defined
  as:</p>
  <p>1 / (total distance from v to all other vertices)</p>
  <p>Closeness scores are calculated using the formula 1 / (average
  distance from vertex v to all other vertices) and Barycenter scores
  are calculated as 1 / (total distance from vertex v to all other
  vertices).</p>
  </blockquote>
  <p>So it appears that for this package it is a difference of the reciprocal of the total vs. reciprocal of the average.</p>
  <p>Notably, wikipedia differs here, in that it matches your source:</p>
  <blockquote>
  <p>Freeman's closeness centrality, the total geodesic distance from a given vertex to all other vertices, is the best known example.<a href="https://en.wikipedia.org/wiki/Centrality#cite_note-Borgatti2006-5" rel="nofollow noreferrer">citation</a></p>
  </blockquote>
  <p><a href="http://www.analytictech.com/networks/centrali.htm" rel="nofollow noreferrer">Yet another source</a> notes the existence of a &quot;normalized&quot; version of Freeman's closeness centrality, which normalizes centrality of a node by the degree of the network. It also comments on whether it is the reciprocal or not:</p>
  <blockquote>
  <p>Closeness (Freeman '79)
  The graph-theoretic distance of a given node to all other nodes. The sum of the rows/columns of the geodesic distance matrix of a graph.</p>
  <p>Simple closeness is an inverse measure of centrality: the larger the numbers, the more distant an actor is, and the less central. Should really be called &quot;farness&quot;.</p>
  <p>Normalized version divides the minimum &quot;farness&quot; possible (N-1) by &quot;farness&quot; to simultaneously make the range 0 to 1 and invert the measure so that larger values correspond to greater centrality (truly &quot;closeness&quot;)</p>
  </blockquote>
  <p>So I guess that it might depend on what tools you are using. Most of the time, it might be the same. Other times, it might be normalized in different ways with either averages or for 0-1 ranges.</p>
  <p>Closeness centrality is probably the more standard term, so it is unlikely that anyone would criticize it. But it appears that there is sometimes some variation in what people mean by that term and whether they are using a normalized or a raw closeness centrality.</p>
  <p>In my opinion the normalization leading to a range from 0-1 is nice because it makes the measure at least somewhat generalizable across networks. But it's up to what you need to do.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-05-17T22:01:55.440Z
Answers.LastActivityDate: 2020-05-17T22:01:55.440Z
Answers.LastEditDate: 2020-06-18T08:30:41.743Z
Answers.UserDisplayName: Maximilian Press
Body: <p>What's the difference between Barycenter Centrality and Closeness Centrality (Freeman)?</p>
  
  <p>Barycenter scores are calculated as 1 / (total distance from vertex v to all other vertices) in a strongly connected network. <a href="https://www.centiserver.org/centrality/Barycenter_Centrality/" rel="nofollow noreferrer">source</a></p>
  
  <p>Closeness Centrality (Freeman) are calculated  total distance from a node v to all the other nodes in a network. <a href="https://www.centiserver.org/centrality/Closeness_Centrality/" rel="nofollow noreferrer">source</a></p>
  
  <p>It looks like the same centrality .</p>
  
  <p>Ps: 
  I want to analyze closeness for my protein–protein interaction network.</p>
  
Tags: <networks><protein-protein-interaction>
Title: What's the difference between Barycenter Centrality and Closeness Centrality (Freeman)?
ThreadText: # What's the difference between Barycenter Centrality and Closeness Centrality (Freeman)?
  
  (Asked by: username_0 on 2020-05-16)
  
  What's the difference between Barycenter Centrality and Closeness Centrality (Freeman)?
  
  Barycenter scores are calculated as 1 / (total distance from vertex v to all other vertices) in a strongly connected network. [source](https://www.centiserver.org/centrality/Barycenter_Centrality/)
  
  Closeness Centrality (Freeman) are calculated total distance from a node v to all the other nodes in a network. [source](https://www.centiserver.org/centrality/Closeness_Centrality/)
  
  It looks like the same centrality .
  
  Ps:
  I want to analyze closeness for my protein–protein interaction network.
  
  **Tags:** networks, protein-protein-interaction
  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2020-05-17. Score: 1 | Accepted answer
  
  First, I'll observe that Freeman centrality as you define it is the reciprocal of the Barycenter centrality as you define. It looks like people often use the reciprocal instead of the original definition, so in that sense they do look the same.
  
  I found the following comparison [here](https://rdrr.io/cran/centiserve/man/barycenter.html) (though it doesn't name it as Freeman):
  
  > There are 2 types of distance centrality scores, Closeness Centrality
  > and Barycenter Centrality. Barycenter Centrality for vertex v defined
  > as:
  >
  > 1 / (total distance from v to all other vertices)
  >
  > Closeness scores are calculated using the formula 1 / (average
  > distance from vertex v to all other vertices) and Barycenter scores
  > are calculated as 1 / (total distance from vertex v to all other
  > vertices).
  
  So it appears that for this package it is a difference of the reciprocal of the total vs. reciprocal of the average.
  
  Notably, wikipedia differs here, in that it matches your source:
  
  > Freeman's closeness centrality, the total geodesic distance from a given vertex to all other vertices, is the best known example.[citation](https://en.wikipedia.org/wiki/Centrality#cite_note-Borgatti2006-5)
  
  [Yet another source](http://www.analytictech.com/networks/centrali.htm) notes the existence of a "normalized" version of Freeman's closeness centrality, which normalizes centrality of a node by the degree of the network. It also comments on whether it is the reciprocal or not:
  
  > Closeness (Freeman '79)
  > The graph-theoretic distance of a given node to all other nodes. The sum of the rows/columns of the geodesic distance matrix of a graph.
  >
  > Simple closeness is an inverse measure of centrality: the larger the numbers, the more distant an actor is, and the less central. Should really be called "farness".
  >
  > Normalized version divides the minimum "farness" possible (N-1) by "farness" to simultaneously make the range 0 to 1 and invert the measure so that larger values correspond to greater centrality (truly "closeness")
  
  So I guess that it might depend on what tools you are using. Most of the time, it might be the same. Other times, it might be normalized in different ways with either averages or for 0-1 ranges.
  
  Closeness centrality is probably the more standard term, so it is unlikely that anyone would criticize it. But it appears that there is sometimes some variation in what people mean by that term and whether they are using a normalized or a raw closeness centrality.
  
  In my opinion the normalization leading to a range from 0-1 is nice because it makes the measure at least somewhat generalizable across networks. But it's up to what you need to do.
  
  
  ---
  
  