This article is cited in 9 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.

UDC: 519.2

Received: 01.04.2009

DOI: 10.4213/dm1104

 English version: Discrete Mathematics and Applications, 2010, 20:5-6, 509–524

Bibliographic databases:

• 
• 
•