Communities in Large Networks: Identification and Ranking

This page contains links to results of experiments reported in the paper "Communities in Large Networks: Identification and Ranking". The experiments was carried out on a crawl of the Danish part of the www graph. I would like to thank Torsten Suel and his colleagues at Polytechnic University in New York for providing the crawl.

Site level experiments

A page level experiment: Identification and Ranking of Danish Chess Pages

A community with 471 Chess pages found with the greedy approach using one representative. The community is found in a subgraph of the crawl consisting of all pages up to three inter site links away from the representative. The links are considered to be undirected when finding the subgraph.

Back to Martin Olsens homepage.