Table of Contents
International Journal of Combinatorics
Volume 2011 (2011), Article ID 872703, 9 pages
http://dx.doi.org/10.1155/2011/872703
Research Article

On the Isolated Vertices and Connectivity in Random Intersection Graphs

Institute for Cyber Security, The University of Texas at San Antonio, San Antonio, TX 78249, USA

Received 10 January 2011; Accepted 5 April 2011

Academic Editor: Liying Kang

Copyright © 2011 Yilun Shang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. B. Singer, Random intersection graphs, Ph.D. thesis, The Johns Hopkins University, Baltimore, Md, USA, 1995.
  2. M. Karoński, E. R. Scheinerman, and K. B. Singer-Cohen, β€œOn random intersection graphs: the subgraph problem,” Combinatorics, Probability and Computing, vol. 8, no. 1-2, pp. 131–159, 1999. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  3. B. Bollobás, Random Graphs, vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, UK, 2nd edition, 2001.
  4. S. Janson, T. Łuczak, and A. Rucinski, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, NY, USA, 2000.
  5. S. R. Blackburn and S. Gerke, β€œConnectivity of the uniform random intersection graph,” Discrete Mathematics, vol. 309, no. 16, pp. 5130–5140, 2009. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  6. O. Yağan and A. M. Makowski, β€œZero-one laws for connectivity in random key graphs,” ISR Technical Report 2009-1, 2009, http://hdl.handle.net/1903/8716. View at Google Scholar
  7. E. Godehardt and J. Jaworski, β€œTwo models of random intersection graphs for classification,” in Exploratory Data Analysis in Empirical Research, M. Schwaiger and O. Opitz, Eds., pp. 67–81, Springer, Berlin, Germany, 2003. View at Google Scholar
  8. O. Yağan and A. M. Makowski, β€œOn the random graph induced by a random key predistribution scheme under full visibility,” in Proceedings of the IEEE International Symposium on Information Theory, pp. 544–548, Toronto, Canada, 2008.
  9. J. A. Fill, E. R. Scheinerman, and K. B. Singer-Cohen, β€œRandom intersection graphs when m=ω(n): an equivalence theorem relating the evolution of the G(n,m,p) and G(n,p) models,” Random Structures & Algorithms, vol. 16, no. 2, pp. 156–176, 2000. View at Google Scholar Β· View at Zentralblatt MATH
  10. P. Erdős and A. Rényi, β€œOn the evolution of random graphs,” Publication of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61, 1960. View at Google Scholar
  11. Y. Shang, β€œTypical vertex degrees in dense generalized random intersection graphs,” Mathematica Applicata, vol. 23, no. 4, pp. 767–773, 2010. View at Google Scholar
  12. D. Stark, β€œThe vertex degree distribution of random intersection graphs,” Random Structures & Algorithms, vol. 24, no. 3, pp. 249–258, 2004. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  13. M. Behrisch, β€œComponent evolution in random intersection graphs,” Electronic Journal of Combinatorics, vol. 14, no. 1, p. R17, 2007. View at Google Scholar Β· View at Zentralblatt MATH
  14. Y. Shang, β€œDegree distributions in general random intersection graphs,” Electronic Journal of Combinatorics, vol. 17, no. 1, p. R23, 2010. View at Google Scholar Β· View at Zentralblatt MATH
  15. A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, vol. 2 of Oxford Studies in Probability, Oxford University Press, New York, NY, USA, 1992. View at Zentralblatt MATH
  16. T. Lindvall, Lectures on the Coupling Method, Dover, Mineola, NY, USA, 2002.