|
Avtomatika i Telemekhanika, 2012, Issue 4, Pages 131–150
(Mi at3794)
|
|
|
|
This article is cited in 18 scientific papers (total in 18 papers)
System Analysis and Operations Research
Structural properties of the scale-free Barabasi–Albert graph
V. N. Zadorozhnyi, E. B. Yudin Omsk State Technical University, Omsk, Russia
Abstract:
Consideration was given to the scale-free Barabasi–Albert graph describing large network structures of the Internet type. A fundamental graph matrix describing precisely the properties of the randomly selected edges was introduced and examined. The formula of the clustering coefficient was derived, and a method for its separable adjustment was proposed which does not affect the distribution of the local connectivity of vertices.
Citation:
V. N. Zadorozhnyi, E. B. Yudin, “Structural properties of the scale-free Barabasi–Albert graph”, Avtomat. i Telemekh., 2012, no. 4, 131–150; Autom. Remote Control, 73:4 (2012), 702–716
Linking options:
https://www.mathnet.ru/eng/at3794 https://www.mathnet.ru/eng/at/y2012/i4/p131
|
|