In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond
Uploaded by: Open Reading Group
Upload date: 2018-03-03 16:52:19
Edited at: 2020-12-11 22:55:26
Edited by: Sergey Kirgizov


Great paper! ### Comparison to existing methods: Doing some experimental comparisons against [Eppstein and Wang 2004]( for the closeness centrality might be interesting. ### Typos: - $|\mathscr{B}_{G}(v,t)|-|\mathscr{B}_{G}(v,t-1)|$ instead of $|\mathscr{B}_{G}(v,t+1)|-|\mathscr{B}_{G}(v,t)|$. This is corrected in the other formula on centralities. - "the the reciprocal of a" - "can be easily computed in a cumulative fashion nothing that" - "on the approximation the diameter" - "its importance it by 1/2" ### Minors: - "Nodes with empty coreachable set have centrality 1 by definition" . By definition the coreachable set of a node is never empty, it contains at least the concerned node.
Open Reading Group at 2018-05-10 16:51:29
Edited by Maximimi at 2019-03-06 07:47:05

Please consider to register or login to comment on the paper.