We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. We prove that this distance is reducible, which enables the use of the nearest-neighbor chain to speed up the agglomeration. The output of the algorithm is a regular dendrogram, which reveals the multi-scale structure of the graph. The results are illustrated on both synthetic and real datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.01664")
get_code_for_paper("1806.01664")
have("1806.01664")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.01664.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.01664)
Connect an agent — have() is free.