International Peer-Reviewed Journal•Open Access•ISSN 2456-8880
irejournals@gmail.com•+91-7433024337

Home / Current Issue / Paper 1722315

1722315 Vol 10 · Issue 2 Download Paper

Graph Analytics for Social Networks

Sachin Sharma

Subject area: Science,Engineering and Technology  ·  Area of research: Graph Theory

DOI: 10.64388/IREV10I2-1722315

Abstract

Social networks generate vast amounts of relational data whose value lies not in individual data points but in the structure of connections among them. Graph analytics offers a mathematically grounded toolkit for uncovering this structure, ranging from simple degree counts to sophisticated community-detection and influence-propagation models. This paper presents a self-contained treatment of graph analytics as applied to social networks. We review the foundational graph-theoretic concepts underlying social network analysis, survey the principal families of graph analytics methods, and examine community detection and influence analysis in depth. To ground the discussion empirically, we conduct a case study on Zachary's Karate Club network and a synthetically generated scale-free network, computing centrality measures, detecting communities using the Louvain algorithm, and analysing degree-distribution behavior. The Louvain method partitions the Karate Club network into four communities with a modularity of 0.4266, closely matching the network's known factional split, while the synthetic network exhibits an approximate power-law degree distribution with exponent 1.76, consistent with preferential-attachment growth. We conclude with a discussion of open challenges and directions for future research, including dynamic graph analytics, scalability to billion-edge networks, and privacy-preserving analysis.

Keywords

graph theory, social network analysis, community detection, Louvain algorithm, centrality, influence analysis, scale-free networks

References

[1] Newman, M. E. J. Networks: An Introduction. Oxford University Press, 2010.

[2] Wasserman, S., and Faust, K. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.

[3] Zachary, W. W. "An Information Flow Model for Conflict and Fission in Small Groups." Journal of Anthropological Research, vol. 33, no. 4, 1977, pp. 452–473.

[4] Blondel, V. D., Guillaume, J.-L., Lambiotte, R., and Lefebvre, E. "Fast Unfolding of Communities in Large Networks." Journal of Statistical Mechanics: Theory and Experiment, 2008.

[5] Girvan, M., and Newman, M. E. J. "Community Structure in Social and Biological Networks." Proceedings of the National Academy of Sciences, vol. 99, no. 12, 2002, pp. 7821–7826.

[6] Barabási, A.-L., and Albert, R. "Emergence of Scaling in Random Networks." Science, vol. 286, no. 5439, 1999, pp. 509–512.

[7] Freeman, L. C. "A Set of Measures of Centrality Based on Betweenness." Sociometry, vol. 40, no. 1, 1977, pp. 35–41.

[8] Kempe, D., Kleinberg, J., and Tardos, É. "Maximizing the Spread of Influence Through a Social Network." Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137–146.

[9] Perozzi, B., Al-Rfou, R., and Skiena, S. "DeepWalk: Online Learning of Social Representations." Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014, pp. 701–710.

[10] Grover, A., and Leskovec, J. "node2vec: Scalable Feature Learning for Networks." Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016, pp. 855–864.

[11] Kipf, T. N., and Welling, M. "Semi-Supervised Classification with Graph Convolutional Networks." International Conference on Learning Representations, 2017.

[12] Watts, D. J., and Strogatz, S. H. "Collective Dynamics of 'Small-World' Networks." Nature, vol. 393, no. 6684, 1998, pp. 440–442.

[13] Hagberg, A. A., Schult, D. A., and Swart, P. J. "Exploring Network Structure, Dynamics, and Function Using NetworkX." Proceedings of the 7th Python in Science Conference (SciPy), 2008, pp. 11–15.

How to cite this paper

Sachin Sharma "Graph Analytics for Social Networks" Iconic Research And Engineering Journals Volume 10 Issue 2 2026 Page 1437-1445 https://doi.org/10.64388/IREV10I2-1722315
Sachin Sharma "Graph Analytics for Social Networks" Iconic Research And Engineering Journals, vol. 10, no. 2, Aug. 2026, doi: https://doi.org/10.64388/IREV10I2-1722315
Sachin Sharma (2026). Graph Analytics for Social Networks. Iconic Research And Engineering Journals, 10(2). doi: https://doi.org/10.64388/IREV10I2-1722315
Sachin Sharma "Graph Analytics for Social Networks" Iconic Research And Engineering Journals, vol. 10, no. 2, Aug. 2026. Crossref, https://doi.org/10.64388/IREV10I2-1722315
@article{1722315,
      author = {Sachin Sharma},
      title = {Graph Analytics for Social Networks},
      journal = {Iconic Research And Engineering Journals},
      year = {2026},
      volume = {10},
      number = {2},
      pages = {1437-1445},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1722315.pdf},
      abstract = {Social networks generate vast amounts of relational data whose value lies not in individual data points but in the structure of connections among them. Graph analytics offers a mathematically grounded toolkit for uncovering this structure, ranging from simple degree counts to sophisticated community-detection and influence-propagation models. This paper presents a self-contained treatment of graph analytics as applied to social networks. We review the foundational graph-theoretic concepts underlying social network analysis, survey the principal families of graph analytics methods, and examine community detection and influence analysis in depth. To ground the discussion empirically, we conduct a case study on Zachary's Karate Club network and a synthetically generated scale-free network, computing centrality measures, detecting communities using the Louvain algorithm, and analysing degree-distribution behavior. The Louvain method partitions the Karate Club network into four communities with a modularity of 0.4266, closely matching the network's known factional split, while the synthetic network exhibits an approximate power-law degree distribution with exponent 1.76, consistent with preferential-attachment growth. We conclude with a discussion of open challenges and directions for future research, including dynamic graph analytics, scalability to billion-edge networks, and privacy-preserving analysis.},
      keywords = {graph theory, social network analysis, community detection, Louvain algorithm, centrality, influence analysis, scale-free networks},
      month = {August},
      doi = {https://doi.org/10.64388/IREV10I2-1722315}
  }