together with brief user bio and description of her/his academic activity.

### Upcoming readings:
No upcoming readings for now...
### Past Readings:
- 21/05/2018 [Graph Embedding Techniques, Applications, and Performance: A Survey](https://papers-gamma.link/paper/52)
- 14/05/2018 [A Fast and Provable Method for Estimating Clique Counts Using Turán’s Theorem](https://papers-gamma.link/paper/24)
- 07/05/2018 [VERSE: Versatile Graph Embeddings from Similarity Measures](https://papers-gamma.link/paper/48)
- 30/04/2018 [Hierarchical Clustering Beyond the Worst-Case](https://papers-gamma.link/paper/45)
- 16/04/2018 [Scalable Motif-aware Graph Clustering](https://papers-gamma.link/paper/18)
- 02/04/2018 [Practical Algorithms for Linear Boolean-width](https://papers-gamma.link/paper/40)
- 26/03/2018 [New Perspectives and Methods in Link Prediction](https://papers-gamma.link/paper/28/New%20Perspectives%20and%20Methods%20in%20Link%20Prediction)
- 19/03/2018 [In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond](https://papers-gamma.link/paper/37)
- 12/03/2018 [Diversity is All You Need: Learning Skills without a Reward Function](https://papers-gamma.link/paper/36)
- 05/03/2018 [When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors](https://papers-gamma.link/paper/23)
- 26/02/2018 [Fast Approximation of Centrality](https://papers-gamma.link/paper/35/Fast%20Approximation%20of%20Centrality)
- 19/02/2018 [Indexing Public-Private Graphs](https://papers-gamma.link/paper/19/Indexing%20Public-Private%20Graphs)
- 12/02/2018 [On the uniform generation of random graphs with prescribed degree sequences](https://papers-gamma.link/paper/26/On%20the%20uniform%20generation%20of%20random%20graphs%20with%20prescribed%20d%20egree%20sequences)
- 05/02/2018 [Linear Additive Markov Processes](https://papers-gamma.link/paper/21/Linear%20Additive%20Markov%20Processes)
- 29/01/2018 [ESCAPE: Efficiently Counting All 5-Vertex Subgraphs](https://papers-gamma.link/paper/17/ESCAPE:%20Efficiently%20Counting%20All%205-Vertex%20Subgraphs)
- 22/01/2018 [The k-peak Decomposition: Mapping the Global Structure of Graphs](https://papers-gamma.link/paper/16/The%20k-peak%20Decomposition:%20Mapping%20the%20Global%20Structure%20of%20Graphs)

☆

2

### Can be extended to k-cliques and k-motifs:
- To list k-cliques: https://github.com/maxdan94/kClist
- To list k-motifs: https://github.com/maxdan94/kmotif
### Typos:
- ", cf.[23],"
- "conductance problem.Notice that"
- "(CNM) [12] , Cfinder"
- "Louvaine" instead of "Louvain" in Table 2

☆

2

It's a very nice paper. There are some parts I don't fully understand yet, as I have to read more on hyperLoglog counter and webgraph framework.
### Comparison to existing methods:
Doing some experimental comparisons to [Eppstein and Wang 2004](https://papers-gamma.link/paper/35) for the closeness centrality might be interesting.
### Typos:
- $\mathscr{B}_{G}(x,r)=\{y | d(x,y) \leq r\}$ instead of $\mathscr{B}_{G}(x,r)=\{y | d(x,y) \leq t\}$
- $|\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.

## Comments: