Abstract
Consider a universal set \({\cal M}\) and a vertex set V and suppose that to each vertex in V we assign independently a subset of \({\cal M}\) chosen at random according to some probability distribution over subsets of \({\cal M}\). By connecting two vertices if their assigned subsets have elements in common, we get a random instance of a random intersection graphs model. In this work, we overview some results concerning the existence and efficient construction of Hamilton cycles in random intersection graph models. In particular, we present and discuss results concerning two special cases where the assigned subsets to the vertices are formed by (a) choosing each element of \({\cal M}\) independently with probability p and (b) selecting uniformly at random a subset of fixed cardinality.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Spencer, J.H.: The probabilistic method. John Wiley & Sons, Inc., New York (2000)
Blackburn, S.R., Gerke, S.: Connectivity of the uniform random intersection graph, arXiv:0805.2814v2 [math.CO]
Blonzelis, M.: Degree Distribution of a Typical Vertex in a General Random Intersection Graph. Lithuanian Math. J. 48(1), 38–45 (2008)
Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
Bradonjić, M., Hagberg, A., Hengartner, N.W., Percus, A.G.: Component evolution in general random intersection graphs. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol. 6516, pp. 36–49. Springer, Heidelberg (2010)
Cooper, C., Frieze, A.: The cover time of sparse random graphs. Random Struct. Algorithms 30, 1–16 (2007)
Deijfen, M., Kets, W.: Random intersection graphs with tunable degree distribution and clustering, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.3535
Efthymiou, C., Spirakis, P.G.: On the existence of Hamilton cycles in random intersection graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 690–701. Springer, Heidelberg (2005)
Fill, J.A., Sheinerman, E.R., Singer-Cohen, K.B.: Random intersection graphs when m = ω(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Struct. Algorithms 16(2), 156–176 (2000)
Godehardt, E., Jaworski, J.: Two models of random intersection graphs for classification. In: Opitz, O., Schwaiger, M. (eds.) Exploratory Data Analysis in Empirical Research. LNCS, pp. 67–82 (2002)
Karoński, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: the subgraph problem. Combinatorics, Probability & Computing 8, 131–159 (1999)
Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Combinatorial properties for efficient communication in distributed networks with local interactions. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, pp. 1–11. IEEE Press, New York (2009)
Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Large independent sets in general random intersection graphs. Theor. Comput. Sci. 406(3), 215–224 (2008)
Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Expander properties and the cover time of symmetric random intersection graphs. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 44–55. Springer, Heidelberg (2007)
Penrose, M.: Random geometric graphs. Oxford Studies in Probability (2003)
Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Sensor networks that are provably resilient. In: 2nd International Conference on Security and Privacy in Communication Networks, pp. 1–10. IEEE Press, New York (2009)
Raptopoulos, C., Spirakis, P.G.: Simple and efficient greedy algorithms for Hamilton cycles in random intersection graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 493–504. Springer, Heidelberg (2005)
Singer-Cohen, K.B.: Random intersection graphs. PhD thesis, John Hopkins University (1995)
Stark, D.: The vertex degree distribution of random intersection graphs. Random Struct. Algorithms 24(3), 249–258 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nikoletseas, S., Raptopoulos, C., Spirakis, P.G. (2011). Selected Combinatorial Properties of Random Intersection Graphs. In: Kuich, W., Rahonis, G. (eds) Algebraic Foundations in Computer Science. Lecture Notes in Computer Science, vol 7020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24897-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-24897-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24896-2
Online ISBN: 978-3-642-24897-9
eBook Packages: Computer ScienceComputer Science (R0)