Vertex Degree of Random Intersection Graph
Probability
2008-09-09 v1
Abstract
A random intersection graph is constructed by independently assigning a subset of a given set of objects to each vertex of the vertex set of a simple graph There is an edge between two vertices of iff their respective subsets(in ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set is derived. Also we determine the almost sure probability bounds for the vertex degree of a typical vertex of graph
Cite
@article{arxiv.0809.1141,
title = {Vertex Degree of Random Intersection Graph},
author = {Bhupendra Gupta},
journal= {arXiv preprint arXiv:0809.1141},
year = {2008}
}