RUS  ENG
Full version
JOURNALS // Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya // Archive

Izv. RAN. Ser. Mat., 2017 Volume 81, Issue 2, Pages 161–214 (Mi im8460)

This article is cited in 1 paper

Distribution of small subgraphs in Buckley–Osthus random graphs

S. D. Tilga

Lomonosov Moscow State University

Abstract: We study a random graph model similar to the Buckley–Osthus preferential attachment model and develop a technique for estimating the expectation of a wide class of random variables in this model. By means of this technique, we prove a theorem on the asymptotic behaviour of the expectation of the number of subgraphs isomorphic to a fixed graph in the random graphs of the model.

Keywords: random graph, internet graph, preferential attachment, Buckley–Osthus model, number of subgraphs.

UDC: 519.175.4

MSC: 05C80, 68M10, 68R10

Received: 18.10.2015

DOI: 10.4213/im8460


 English version:
Izvestiya: Mathematics, 2017, 81:2, 391–443

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025