THE LIMITING PROBABILITY THAT ALPHA-IN, BETA-OUT IS STRONGLY CONNECTED

被引：4

作者：

COOPER, C ^{[1
]}

FRIEZE, AM ^{[1
]}

机构：

[1] CARNEGIE MELLON UNIV,DEPT MATH,PITTSBURGH,PA 15213

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1990年 / 48卷 / 01期

关键词：

D O I：

10.1016/0095-8956(90)90134-L

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider a random digraph Dα,β(n) with vertex set {1, 2, ..., n} in which each vertex v independently chooses α random arcs entering v and β random arcs leaving v. We compute the limiting probability that Dα,β(n) is strongly connected as n tends to infinity. This solves an open problem from [2]. © 1990.

引用

页码：117 / 134

页数：18