Random graphs model for description of interactions in the network

A. A. Grusho^ab, E. E. Timonina<sup>a

a</sup> Institute for Problems of Informatics of RAS
^b M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics

Abstract: A new class of random graphs urged to simulate network functioning in time is considered. It is supposed that observations over a network are carried by means of a “window” method. To detect the anomalies, normal behavior which can be watched in “windows” of a considered model is studied. The asymptotic value of the maximum degree of vertices in graph which is generated by a “window” of certain size is analyzed.

Keywords: random graphs; simulation of wide area networks; information security; abnormal behavior.