On the Number of Subgraphs of a Random Graph in the Barabasi-Albert Model

被引：0

作者：

Ryabchenko, A. A. ^{[1
]}

Samosvat, E. A. ^{[1
]}

机构：

[1] Moscow Inst Phys & Technol, Dolgoprudnyi 141700, Moscow Oblast, Russia

来源：

DOKLADY MATHEMATICS | 2010年 / 82卷 / 03期

基金：

俄罗斯基础研究基金会;

关键词：

DIAMETER;

D O I：

10.1134/S1064562410060281

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The number of subgraphs of a random graph in the Barabasi-Albert model are studied. The number of models appearing as a result of removing the inaccuracy of the graph is very large, and the properties of the models are very diverse. For any integer function there exists a Barabasi-Albert type model in which a random graph contains precisely triangles with probability tending to 1. A random graph on t vertices with some edges is constructed and a sequence of vertices is taken. One more Barabasi-Albert-type model is considered, two very general assertions are valid. Under homogenization, any random variable from a very large class of quantities defined on the space transforms into a constant multiplied by a random variable on the space.

引用

页码：946 / 949

页数：4