Home/International Journal of Combinatorics/Article Record
Peer-Reviewed Article May 29, 2011

On the Isolated Vertices and Connectivity in Random Intersection Graphs

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: International Journal of Combinatorics
Publisher: Hindawi Publishing Corporation • Egypt • 1687-9163
DOI: https://doi.org/10.1155/2011/872703

Abstract

We study isolated vertices and connectivity in the random intersection graph . 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 and , we give the asymptotic probability of connectivity at the threshold for connectivity. Analogous results are well known in Erdős-Rényi random graphs.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

15
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.