Random graphs model for description of interactions in the network

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.