KarRC RAS
in social media
in social media
Publications
Scientific publications
Чеплюкова И.А.
О глобальном кластерном коэффициенте условного конфигурационного графа
// Труды КарНЦ РАН. No 6. Сер. Математическое моделирование и информационные технологии. 2026. C. 106-113
Cheplyukova I.A. On the global clustering coefficient of а conditional configuration graph // Transactions of Karelian Research Centre of Russian Academy of Science. No 6. Mathematical Modeling and Information Technologies. 2026. Pp. 106-113
Keywords: configuration graph; clustering coefficient; limit theorems
We consider configuration graphs with N vertices. The vertex degrees are independent equally distributed random variables whose distribution satisfies the following condition: as k→∞
pk = P{ξ = k} ∼ h(k) / kτ+1, τ>0,
where the random value η is equal to the degree of any vertex of the graph and the function h(x) is slowly varying (in the Karamata sense). The global clustering coefficient of a conditional configuration graph is investigated for different values of the parameter τ > 0. Limit theorems are obtained for this characteristic as the number of vertices tends to infinity.
pk = P{ξ = k} ∼ h(k) / kτ+1, τ>0,
where the random value η is equal to the degree of any vertex of the graph and the function h(x) is slowly varying (in the Karamata sense). The global clustering coefficient of a conditional configuration graph is investigated for different values of the parameter τ > 0. Limit theorems are obtained for this characteristic as the number of vertices tends to infinity.
DOI: 10.17076/mat2367
Indexed at RSCI, RSCI (WS)
Last modified: July 3, 2026