期刊名称：International Journal of Statistics and Probability
印刷版ISSN：1927-7032
电子版ISSN：1927-7040
出版年度：2015
卷号：4
期号：1
页码：76
DOI：10.5539/ijsp.v4n1p76
出版社：Canadian Center of Science and Education
摘要：We consider preferential attachment random graphs which may be obtained as follows: It starts with a single node. If a new node appears, it is linked by an edge to one or more existing node(s) with a probability proportional to function of their degree. For a class of linear preferential attachment random graphs we find a large deviation principle (LDP) for the empirical degree measure. In the course of the prove this LDP we establish an LDP for the empirical degree and pair distribution see Theorem 2.3, of the fitness preferential attachment model of random graphs.
Loading...
