Erdos Renyi Random Graph a nd Machine Learning Based Botnet Detection

  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


Basically large networks are prone to attacks by bots and lead to complexity. When the complexity occurs then it is difficult to overcome the vulnerability in the network connections. In such a case, the complex network could be dealt with the help of probability theory and graph theory concepts like Erdos – Renyi random graphs, Scale free graph, highly connected graph sequences and so on. In this paper, Botnet detection using Erdos – Renyi random graphs whose patterns are recognized as the number of connections that the vertices and edges made in the network is proposed. This paper also presents the botnet detection concepts based on machine learning.




Akilandeswari, Dr. K., Baranivel*, Mr. L., & Basha, Mr. G. A. (2020). Erdos Renyi Random Graph a nd Machine Learning Based Botnet Detection. International Journal of Innovative Technology and Exploring Engineering, 9(5), 1037–1040.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free