Construction of simple graphs with a target joint degree matrix and beyond

Proceedings - IEEE INFOCOM

Volumn 26, Issue , 2015, Pages 1553-1561

  Gjoka, Minas ^a   Tillman, Balint ^a   Markopoulou, Athina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS;

CLUSTERING COEFFICIENT; CONSTRUCTION ALGORITHMS; GRAPH STRUCTURES; MONTE CARLO MARKOV CHAIN; NETWORK PROPERTIES; ORDERS OF MAGNITUDE; STATE OF THE ART; SYNTHETIC GRAPHS;

GRAPHIC METHODS;

EID: 84954245277     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2015.7218534     Document Type: Conference Paper

References (21)

1. Simple Graph: http: //mathworld. wolfram. com/SimpleGraph. html.
2. SNAP Graph Library: http: //snap. stanford. edu/data/.
3. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In Proc. of STOC, 2000.
4. S. Bansal, S. Khandelwal, and L. Meyers. Exploring biological network structure with clustered random networks. BMC Bioinformatics, 2009.
5. 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, 2010.
6. N. Developers. Networkx. networkx. lanl. gov, 2010.
7. X. Dimitropoulos, D. Krioukov, A. Vahdat, and G. Riley. Graph annotations in modeling complex network topologies. TOMACS, 2009.
8. S. Dorogovtsev. Networks with desired correlations. arXiv 0308336'03.
9. M. Gjoka, M. Kurant, and A. Markopoulou. 2. 5K-Graphs: from Sampling to Generation. In Proc. of IEEE INFOCOM, 2013.
10. P. Holme and B. J. Kim. Growing scale-free networks with tunable clustering. Physical review E, 65 (2): 026107, 2002.
11. D. R. Hunter, M. Handcock, C. Butts, S. M. Goodreau, and M. Morris. ergm: A package to fit, simulate and diagnose exponential-family models for networks. Journal of Statistical Software, 24 (3), 2008.
12. P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat. Systematic topology analysis and generation using degree correlations. In SIGCOMM, 2006.
13. A. Mislove, M. Marcon, K. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, 2007.
14. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random structures and algorithms, 1995.
15. M. Newman. Random graphs with clustering. Phys. review letters, 2009.
16. J. J. Pfeiffer III, S. Moreno, T. La Fond, J. Neville, and B. Gallagher. Attributed graph models: Modeling network structure with correlated attributes. In Proc. of WWW, 2014.
17. M. Serrano and M. Boguñá. Tuning clustering in random networks with arbitrary degree distributions. Physical Review E, Sept. 2005.
18. I. Stanton and A. Pinar. Constructing and sampling graphs with a prescribed joint degree distribution using markov chains. JEA, 2011.
19. A. Traud, P. Mucha, and M. Porter. Social Structure of Facebook Networks. Arxiv preprint arXiv: 1102. 2166, 2011.
20. B. Viswanath, A. Mislove, M. Cha, and K. Gummadi. On the evolution of user interaction in facebook. In Proc. WOSN, 2009.
21. Y. Amanatidis and B. Green and M. Mihail. Graphic realizations of joint-degree matrices. Unpublished manuscript, 2008.