- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
International Journal of Combinatorics
Volume 2011 (2011), Article ID 872703, 9 pages
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.
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.
The classical random graph , introduced by Erdős and Rényi in the late 1950s, consists of a fixed set of vertices and edges that exist with a certain probability , independently from each other. Since then many other random graph models with dependent edges have been developed. Among them, random intersection graph [1, 2] is defined as follows. Consider a set with vertices and another universal set with elements. Define a bipartite graph with independent vertex sets and . Edges between and exist independently with probability . The random intersection graph derived from is defined on the vertex set with vertices adjacent if and only if there exists some such that both and are adjacent to in .
Appropriately scaling the parameter as with some , Singer-Cohen  establishes connectivity thresholds for : the threshold lies at and for and , respectively. The result also reveals an asymptotic equivalence of graph connectivity and absence of isolated vertices in , that is, the zero-one law for the absence of isolated vertices is equal to that for connectivity. This is familiar in Erdős-Rényi model; see [3, 4] for more details. The study in the present paper is in continuation of Chapter 3 in . Taking our cue from existing results for Erdős-Rényi graphs (e.g., [4, Corollary 3.31] and [3, Theorem 7.3]), we aim to explore similar results for the properties of isolated vertices and connectivity in .
The connectivity thresholds of another class of random intersection graphs , called random key graphs or uniform random intersection graphs, have been investigated recently [5, 6]. Both and can be viewed as subclasses of a general model . In , the authors determine a zero-one law for the absence of isolated vertices in , which again turns out to be equivalent to that for graph connectivity . Moreover, they show a Poisson convergence for the number of isolated vertices, which refines the corresponding zero-one law and leads to a “double exponential” result.
In this paper, we deal with the asymptotic distribution of the number of isolated vertices and address the connectivity probability in with , . A Poisson approximation result (Theorem 2.1) for the number of isolated vertices is obtained by utilizing the Stein-Chen method, which yields convergence to a Poisson random variable. The isolated vertices threshold [1, Proposition 3.2] now readily follows from our Theorem 2.1 by an easy monotonicity argument. In addition, based on a strong equivalence theorem  relating the and models we derive an approximation of the probability of connectivity at the threshold when (see Theorem 2.3), which is analogous to the well-known “double exponential” result of Erdős and Rényi .
Other related works regarding model have been reported. For example, [11, 12] examines the limiting distribution of the degree of a typical vertex,  treats the evolution of the order of the largest component, and random weights are assigned to the vertices in  to get general degree distributions.
The rest of the paper is organized as follows. Our main results are presented in Section 2. Sections 3 and 4 contain technical proofs of Theorems 2.1 and 2.3, respectively. Throughout the paper we set for some .
2. Main Results
In this section we provide our main results. Let denote the number of isolated vertices in and let be a Poisson random variable with parameter . Denote by and the mean and variance of random variable , respectively. Recall that the Poisson random variable has the unusual property that the mean and variance are both equal to the parameter .
Theorem 2.1. In the model , let where . If , then one has as , where represents convergence in distribution.
The upcoming corollary is immediate from Theorem 2.1.
Corollary 2.2. In the model with determined through (2.1), suppose . Then one gets
For a parallel “double exponential” result for connectivity when is large, we have the following.
Theorem 2.3. In the model with and determined through (2.1) (i.e., ), assume that . Then one has
These results complement those presented in  and get further insight into the evolutionary similarities and differences between and models. A natural question would be to ask what happens for connectivity probability when is small. This is currently under investigation.
3. Proof of Theorem 2.1
Before proceeding, we first introduce some definitions and notations. Let and denote the cardinality of a set . For two integer-valued random variables and , the total variation distance between them (more correctly, between their distributions and ) is given by Let be a finite set of indices and let be a family of random indicator variables. We say are positively related (c.f. ) if, for each , there exist random indicator variables with the distributions such that for every . It is notable that “positively related” is much stronger than “positively correlated”. Suppose and are sequences of positive real numbers. We write if .
A useful result obtained by the Stein-Chen method is the following.
The next lemma collects some well-known approximations that are used in this paper.
Lemma 3.2. If , then ; and if , then .
In the sequel, we estimate the expectation of random variable .
Lemma 3.3. Suppose . Under the assumptions of Theorem 2.1, one gets
Proof. The probability that a vertex is isolated can be computed as
where the index represents the number of vertices in which are adjacent to in . Hence
For , we have as . Thus by Lemma 3.2, we obtain as .
For , note that as . By using Lemma 3.2, we have as . The proof is then complete.
Proof of Theorem 2.1. The triangular inequality for the total variation distance implies
By a coupling argument ([16, page 58]) and Lemma 3.3, we have
as . Combining this with (3.11), we now only need to prove
First, we claim that are positively related. To see this, define for every , where represents the elements in which are adjacent to in ( is possibly empty). The random graphs and are coupled in a natural way. Conditional on the isolation of vertex in , any vertex is not adjacent to vertices of in . Hence, we have For every , if then . Consequently, we get .
By Lemma 3.1, the binary nature and exchangeability of the random variables involved, we find that The cross term in (3.16) is shown to be given by where counts the number of vertices in adjacent to neither 1 or 2 in , leaving vertices in adjacent to exactly one of 1, 2.
Combining (3.5), (3.16), and (3.17) readily gives
For , we have similarly as in the proof of Lemma 3.3, as . Thereby, it follows from Lemma 3.2 that Applying this to (3.18), we obtain as .
For , we get as in the proof of Lemma 3.3, as . Hence, from Lemma 3.2 we have Applying this to (3.18), we have as , which concludes the proof.
4. Proof of Theorem 2.3
Let The following lemma drawn from  states an equivalence of and models.
Lemma 4.1 (see ). Let and be such that for some . For any and any graph property , as if it follows that
We recall the following classical result for connectivity threshold of .
Lemma 4.2 (see ). Let be fixed and . Then as .
Proof of Theorem 2.3. In view of Lemmas 4.1 and 4.2, it suffices to prove that
By the assumptions, we find that where denotes . Since as , by Lemma 3.2, the right-hand side of (4.6) which concludes the proof.
The author would like to thank Karen Singer-Cohen for her warm encouragement and supplying a copy of .
- K. B. Singer, Random intersection graphs, Ph.D. thesis, The Johns Hopkins University, Baltimore, Md, USA, 1995.
- 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.
- B. Bollobás, Random Graphs, vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, UK, 2nd edition, 2001.
- S. Janson, T. Łuczak, and A. Rucinski, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, NY, USA, 2000.
- S. R. Blackburn and S. Gerke, “Connectivity of the uniform random intersection graph,” Discrete Mathematics, vol. 309, no. 16, pp. 5130–5140, 2009.
- 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.
- 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.
- 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.
- J. A. Fill, E. R. Scheinerman, and K. B. Singer-Cohen, “Random intersection graphs when : an equivalence theorem relating the evolution of the and models,” Random Structures & Algorithms, vol. 16, no. 2, pp. 156–176, 2000.
- 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.
- Y. Shang, “Typical vertex degrees in dense generalized random intersection graphs,” Mathematica Applicata, vol. 23, no. 4, pp. 767–773, 2010.
- D. Stark, “The vertex degree distribution of random intersection graphs,” Random Structures & Algorithms, vol. 24, no. 3, pp. 249–258, 2004.
- M. Behrisch, “Component evolution in random intersection graphs,” Electronic Journal of Combinatorics, vol. 14, no. 1, p. R17, 2007.
- Y. Shang, “Degree distributions in general random intersection graphs,” Electronic Journal of Combinatorics, vol. 17, no. 1, p. R23, 2010.
- 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.
- T. Lindvall, Lectures on the Coupling Method, Dover, Mineola, NY, USA, 2002.