On the number of subgraphs of the Barabasi-Albert random graph

被引：3
|
作者：
Ryabchenko, A. A. [1 ]
Samosvat, E. A. [1 ]
机构：
[1] Moscow Inst Phys & Technol, Moscow, Russia
来源：
IZVESTIYA MATHEMATICS | 2012年 / 76卷 / 03期
关键词：
random graph; Internet graph; preferential attachment; Barabasi-Albert model; number of subgraphs; DIAMETER;
D O I：
10.1070/IM2012v076n03ABEH002597
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study a model of a random graph of the type of the Barabasi-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.
引用
收藏
页码：607 / 625
页数：19
相关论文
共 50 条
  • [1] On the Number of Subgraphs of a Random Graph in the Barabasi-Albert Model
    Ryabchenko, A. A.
    Samosvat, E. A.
    DOKLADY MATHEMATICS, 2010, 82 (03) : 946 - 949
  • [2] On the number of subgraphs of a random graph in the Barabasi-Albert model
    A. A. Ryabchenko
    E. A. Samosvat
    Doklady Mathematics, 2010, 82 : 946 - 949
  • [3] Barabasi-Albert random graph with multiple type edges and perturbation
    Backhausz, A.
    Rozner, B.
    ACTA MATHEMATICA HUNGARICA, 2020, 161 (01) : 212 - 229
  • [4] A generalization of the Barabasi-Albert random tree
    Fazekas, Istvan
    Pecsora, Sandor
    ANNALES MATHEMATICAE ET INFORMATICAE, 2015, 44 : 71 - 85
  • [5] On the continuous-time limit of the Barabasi-Albert random graph
    Pachon, Angelica
    Polito, Federico
    Sacerdote, Laura
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 378
  • [6] Structural properties of the scale-free Barabasi-Albert graph
    V. N. Zadorozhnyi
    E. B. Yudin
    Automation and Remote Control, 2012, 73 : 702 - 716
  • [7] First encounters on Watts-Strogatz networks and Barabasi-Albert networks
    Yuan, Zhenhua
    Chen, Yongjin
    Gao, Long
    Peng, Junhao
    CHAOS, 2022, 32 (12)
  • [8] Maximum sparse induced subgraphs of the binomial random graph with given number of edges
    Kamaldinov, Dmitry
    Skorkin, Arkadiy
    Zhukovskii, Maksim
    DISCRETE MATHEMATICS, 2021, 344 (02)
  • [9] Regular Induced Subgraphs of a Random Graph
    Krivelevich, Michael
    Sudakov, Benny
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 235 - 250
  • [10] Distribution of small subgraphs in Buckley-Osthus random graphs
    Tilga, S. D.
    IZVESTIYA MATHEMATICS, 2017, 81 (02) : 391 - 443
12345