Java implementation of the Albatross graph sampling algorithm.
Basically just an ugly port of the C# source code. Probably further development and refactoring to come.
Modifications of the original program:
- Additional method allowing to export a sampled graph as a Pajek file.
- Additional R scripts allowing to compare original and sampled networks, in terms of topological properties.
Originally developped by Long Jin 2011
- Original C# source code available here: http://code.google.com/p/sampling-social-graphs/
- Bibliographic reference: Long Jin, Yang Chen, Pan Hui, Cong Ding, Tianyi Wang, Athanasios Vasilakos, Beixing Deng, Xing Li, "Albatross Sampling: Robust and Effective Hybrid Vertex Sampling for Social Graphs", in Proc. of the 3rd ACM Workshop on Hot Topics in Planet-scale Measurement (HotPlanet'11), co-located with ACM MobiSys 2011, June 2011.
Ported to Java by Vincent Labatut 06/2013
- http://galatasaray.academia.edu/VincentLabatut
- Galatasaray University - Complex Networks lab - http://bit.gsu.edu.tr/compnet