Degree relations of triangles in real-world networks and graph models

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 1712-1716

  Durak, Nurcan ^a   Pinar, Ali ^a   Kolda, Tamara G ^a   Seshadhri, C ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

graph models; social networks; triangles in graphs

Indexed keywords

GRAPHIC METHODS; INFORMATION SERVICES; KNOWLEDGE MANAGEMENT; SOCIAL NETWORKING (ONLINE);

BUILDING BLOCKES; GRAPH MODEL; HETEROGENEOUS GRAPH; INFORMATION NETWORKS; REAL-WORLD GRAPHS; REAL-WORLD NETWORKS; SALIENT FEATURES; TRIANGLES IN GRAPHS;

GRAPH THEORY;

EID: 84871081680     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2398503     Document Type: Conference Paper

References (20)

1. Barabási, A.-L., and Albert, R. Emergence of scaling in random networks. Science 286, 5349 (1999), 509-512.
2. Berry, J. W., Hendrickson, B., LaViolette, R. A., and Phillips, C. A. Tolerating the community detection resolution limit with edge weighting. Phys. Rev. E 83 (May 2011), 056119.
3. Chung, F., and Lu, L. The average distances in random graphs with given expected degrees. PNAS 99 (2002), 15879-15882.
4. Clauset, A., Shalizi, C. R., and Newman, M. E. J. Power-law distributions in empirical data. SIAM Review 51, 4 (2009), 661-703.
5. Cohen, J. Graph twiddling in a MapReduce world. Computing in Science & Engineering 11 (2009), 29-41.
6. Contractor, N. S., Wasserman, S., and Faust, K. Testing multitheoretical organizational networks: An analytic framework and empirical example. Academy of Management Review 31, 3 (2006), 681-703.
7. Durak, N., Pinar, A., Kolda, T. G., and Seshadhri, C. Degree relations of triangles in real-world networks and graph models. arXiv:1207.7125, 2012.
8. Holme, P., and Zhao, J. Exploring the assortativity-clustering space of a network's degree sequence. Phys. Rev. E 75 (Apr. 2007), 046111.
9. Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A. S. The web as a graph: measurements, models, and methods. In Proc. COCOON'99 (1999), Springer-Verlag, pp. 1-17.
10. Leskovec, J., and Faloutsos, C. Scalable modeling of real graphs using Kronecker multiplication. In Proc. ICML'07 (2007), ACM, pp. 497-504.
11. Leskovec, J., Kleinberg, J., and Faloutsos, C. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proc. KDD'05 (2005), ACM, pp. 177-187.
12. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., and Alon, U. Network motifs: Simple building blocks of complex networks. Science 298, 5594 (2002), 824-827.
13. Newman, M. E. J. Assortative mixing in networks. Phys. Rev. Letter 89 (May 2002), 208701.
14. PRÏ£
15. Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., and Zhao, B. Y. Measurement-calibrated graph models for social network experiments. In Proc. WWW'10 (2010), ACM, pp. 861-870.
16. Seshadhri, C., Kolda, T. G., and Pinar, A. Community structure and scale-free collections of Erdo{combining double acute accent}s-Rényi graphs. Phys. Rev. E 85, 056109 (May 2012).
17. Tsourakakis, C. Fast counting of triangles in large real networks without counting: Algorithms and laws. In Proc. ICDM'08 (2008), pp. 608-617.
18. Watts, D., and Strogatz, S. Collective dynamics of 'small-world' networks. Nature 393 (1998), 440-442.
19. Whitney, D. E., and Alderson, D. Are technological and social networks really different? In Unifying Themes in Complex Systems, A. Minai, D. Braha, and Y. Bar-Yam, Eds. Springer, 2010, pp. 74-81.
20. Stanford Network Analysis Project (SNAP). Available at http://snap.stanford.edu/.