2.5K-graphs: From sampling to generation

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 1968-1976

  Gjoka, Minas ^a   Kurant, Maciej ^b   Markopoulou, Athina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SWISS FEDERAL INSTITUTE OF TECHNOLOGY   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING COEFFICIENT; DEGREE DISTRIBUTIONS; EFFICIENT ESTIMATOR; EXTENSIVE SIMULATIONS; NETWORK STRUCTURES; REALISTIC GRAPHS; STATE-OF-THE-ART TECHNIQUES; TOPOLOGICAL METRICS;

ALGORITHMS; GRAPHIC METHODS;

TOPOLOGY;

EID: 84883094937     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6566997     Document Type: Conference Paper

References (24)

1. 2.5K Generator Source Code: http://tinyurl.com/2-5K-Generator.
2. SNAP Graph Library: http://snap.stanford.edu/data/.
3. S. Bansal, S. Khandelwal, and L. Meyers. Exploring biological network structure with clustered random networks. BMC Bioinformatics, 2009.
4. C. I. Del Genio, H. Kim, Z. Toroczkai, and K. E. Bassler. Efficient and exact sampling of simple graphs with given arbitrary degree sequence. PloS one, 5(4):e10012, Jan. 2010.
5. M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou. Multigraph Sampling of Online Social Networks. IEEE JSAC, 29(9), 2011.
6. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In Proc. IEEE INFOCOM, San Diego, CA, 2010.
7. M. Handcock and K. Gile. Modeling social networks from sampled data. The Annals of Applied Statistics, 4(1):5-25, 2010.
8. M. Hansen and W. Hurwitz. On the Theory of Sampling from Finite Populations. Annals of Mathematical Statistics, 14(3), 1943.
9. M. Kim and J. Leskovec. The network completion problem: Inferring missing nodes and edges in networks. Proc. SDM, 2011.
10. D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguńa. Hyperbolic geometry of complex networks. Physical Review E, 2010.
11. M. Kurant, M. Gjoka, C. T. Butts, and A. Markopoulou. Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks. In Proc. of ACM SIGMETRICS, 2011.
12. P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat. Systematic topology analysis and generation using degree correlations. In SIGCOMM, 2006.
13. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures & Algorithms, 1995.
14. M. Newman. Random graphs with clustering. Phys. review letters, 2009.
15. B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In Proc. IMC, 2010.
16. A. Sala, L. Cao, C. Wilson, R. Zablit, H. Zheng, and B. Zhao. Measurement-calibrated graph models for social network experiments. In Proc. WWW, New York, NY, 2010.
17. A. Sala, X. Zhao, C. Wilson, H. Zheng, and B. Zhao. Sharing graphs using differentially private graph models. In Proc. IMC, 2011.
18. D. Scott. Multivariate density estimation. Wiley Online Library, 1992.
19. M. Serrano and M. Boguna. Tuning clustering in random networks with arbitrary degree distributions. Physical Review E, Sept. 2005.
20. I. Stanton and A. Pinar. Constructing and sampling graphs with a prescribed joint degree distribution using markov chains. In arXiv:1103.4875v2. Alenex, 2011.
21. I. Stanton and A. Pinar. Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. Work, 2011.
22. A. Traud, P. Mucha, and M. Porter. Social Structure of Facebook Networks. Arxiv preprint arXiv:1102.2166, 2011.
23. B. Viswanath, A. Mislove, M. Cha, and K. Gummadi. On the evolution of user interaction in facebook. In Proc. WOSN, 2009.
24. D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.