On the number of subgraphs of the Barab\'asi--Albert random graph
Izvestiya. Mathematics , Tome 76 (2012) no. 3, pp. 607-625
Voir la notice de l'article provenant de la source Math-Net.Ru
We study a model of a random graph of the type of the
Barabási–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.
Keywords:
random graph, preferential attachment,
Barabási–Albert model, number of subgraphs.
Mots-clés : Internet graph
Mots-clés : Internet graph
@article{IM2_2012_76_3_a7,
author = {A. A. Ryabchenko and E. A. Samosvat},
title = {On the number of subgraphs of the {Barab\'asi--Albert} random graph},
journal = {Izvestiya. Mathematics },
pages = {607--625},
publisher = {mathdoc},
volume = {76},
number = {3},
year = {2012},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_2012_76_3_a7/}
}
A. A. Ryabchenko; E. A. Samosvat. On the number of subgraphs of the Barab\'asi--Albert random graph. Izvestiya. Mathematics , Tome 76 (2012) no. 3, pp. 607-625. http://geodesic.mathdoc.fr/item/IM2_2012_76_3_a7/