On the Isolated Vertices and Connectivity in Random Intersection Graphs
Author
Source
International Journal of Combinatorics
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-05-30
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
We study isolated vertices and connectivity in the random intersection graph G(n,m,p).
A Poisson convergence for the number of isolated vertices is determined at the threshold for absence of isolated vertices, which is equivalent to the threshold for connectivity.
When m=⌊nα⌋ and α>6, we give the asymptotic probability of connectivity at the threshold for connectivity.
Analogous results are well known in Erdős-Rényi random graphs.
American Psychological Association (APA)
Shang, Yilun. 2011. On the Isolated Vertices and Connectivity in Random Intersection Graphs. International Journal of Combinatorics،Vol. 2011, no. 2011, pp.1-9.
https://search.emarefa.net/detail/BIM-505138
Modern Language Association (MLA)
Shang, Yilun. On the Isolated Vertices and Connectivity in Random Intersection Graphs. International Journal of Combinatorics No. 2011 (2011), pp.1-9.
https://search.emarefa.net/detail/BIM-505138
American Medical Association (AMA)
Shang, Yilun. On the Isolated Vertices and Connectivity in Random Intersection Graphs. International Journal of Combinatorics. 2011. Vol. 2011, no. 2011, pp.1-9.
https://search.emarefa.net/detail/BIM-505138
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-505138
