ALGORITHMIC MEANS OF PER COLAT IVE PROCESSES MODELLING IN RANDOM NETWORK STRUCTURES
Скачать PDF
Annotation: Research ing distribution and clustering of information in randomly topologised social network knots is very relevant task for economy, advertizing, marketing, sociology, political science, etc. This work considers either randomly composed social structures development algorithms or its percolative processes development algorithms in order to define the influence of average communications number on percolation threshold size and also on other important processes .
Keywords: knots clusteri ng, random topology, random networks organisation algorithms, percolati ve processes, percolation threshold
For citation: Zaltsman A.D. Algorithmic means of per colat ive processes modelling in random network structures // Electronic Scientific Journal IT-Standard. – 2017. – No. 3. – pp. .