Geodesic
On conditional Internet graphs whose vertex degrees have no mathematical expectation
Diskretnaya Matematika, Tome 22 (2010) no. 3, pp. 20-33

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DM_2010_22_3_a2,
     author = {Yu. L. Pavlov},
     title = {On conditional {Internet} graphs whose vertex degrees have no mathematical expectation},
     journal = {Diskretnaya Matematika},
     pages = {20--33},
     publisher = {mathdoc},
     volume = {22},
     number = {3},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2010_22_3_a2/}
}
TY  - JOUR
AU  - Yu. L. Pavlov
TI  - On conditional Internet graphs whose vertex degrees have no mathematical expectation
JO  - Diskretnaya Matematika
PY  - 2010
SP  - 20
EP  - 33
VL  - 22
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2010_22_3_a2/
LA  - ru
ID  - DM_2010_22_3_a2
ER  - 
%0 Journal Article
%A Yu. L. Pavlov
%T On conditional Internet graphs whose vertex degrees have no mathematical expectation
%J Diskretnaya Matematika
%D 2010
%P 20-33
%V 22
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2010_22_3_a2/
%G ru
%F DM_2010_22_3_a2
Yu. L. Pavlov. On conditional Internet graphs whose vertex degrees have no mathematical expectation. Diskretnaya Matematika, Tome 22 (2010) no. 3, pp. 20-33. http://geodesic.mathdoc.fr/item/DM_2010_22_3_a2/