[CollEc] Link to new COllEc

[Düben, Christian]

As far as I understand it, the normalized closeness is "N / (sum d)" or "(N - 1) / (sum d)". Whereas average path length is "(sum d) / N". See https://en.wikipedia.org/wiki/Closeness_centrality or https://neo4j.com/docs/graph-algorithms/current/labs-algorithms/closeness-centrality/.

Christian Düben
Research Associate
Chair of Macroeconomics
Hamburg University
Von-Melle-Park 5, Room 3102
20146 Hamburg
Germany
+49 40 42838 1898
christian.dueben at uni-hamburg.de
http://www.christian-dueben.com

-----Original Message-----
From: Thomas Krichel <krichel at openlib.org> 
Sent: Mittwoch, 6. Januar 2021 05:22
To: Düben, Christian <Christian.Dueben at uni-hamburg.de>
Cc: CollEc Run <collec-run at lists.openlib.org>
Subject: Re: [CollEc] Link to new COllEc

  Düben, Christian writes

> I can introduce additional stats. But then I should call them 
> differently. I do not say that average path length is not interesting. 
> But selling it to users as "closeness" is like calculating means and 
> then labelling it "variance".

  Well, I have been living my live thinking that the closeness is the
  same average path length.  Wikipedia says the same at
  https://en.wikipedia.org/wiki/Centrality

In a connected graph, the normalized closeness centrality (or
closeness) of a node is the average length of the shortest path between the node and all other nodes in the graph.


-- 

  Cheers,

  Thomas Krichel                  http://openlib.org/home/krichel
                                              skype:thomaskrichel