Những tài liệu gần giống với tài liệu bạn đang xem
The largest component in an inhomogeneous random intersection graph with clustering
Let Q be a probability measure on {0, 1, . ,m}, and let S1, . , Sn be random subsets of a set W = {w1, . ,wm} drawn independently from the probability distribution P(Si = A) = m |A| −1 Q(|A|), A ⊂ W, for i = 1, . , n. A random intersection graph
pdf Đăng bởi
ducle2211
