|
This article is cited in 8 scientific papers (total in 8 papers)
On conditional Internet graphs whose vertex degrees have no mathematical expectation
Yu. L. Pavlov
Abstract:
We consider conditional random graphs of Internet type under the condition that the number of edges of the graph is known and the degrees of the vertices have no mathematical expectation. We prove limit theorems for the maximum vertex degree and the number of vertices of a given degree.
Received: 01.04.2009
Citation:
Yu. L. Pavlov, “On conditional Internet graphs whose vertex degrees have no mathematical expectation”, Diskr. Mat., 22:3 (2010), 20–33; Discrete Math. Appl., 20:5-6 (2010), 509–524
Linking options:
https://www.mathnet.ru/eng/dm1104https://doi.org/10.4213/dm1104 https://www.mathnet.ru/eng/dm/v22/i3/p20
|
Statistics & downloads: |
Abstract page: | 513 | Full-text PDF : | 225 | References: | 67 | First page: | 17 |
|