Abstract
Random Intersection Graphs is a new class of random graphs introduced in [5], in which each of n vertices randomly and independently chooses some elements from a universal set, of cardinality m. Each element is chosen with probability p. Two vertices are joined by an edge iff their chosen element sets intersect. Given n, m so that m=n α, for any real α different than one, we establish here, for the first time, tight lower bounds p 0(n,m), on the value of p, as a function of n and m, above which the graph G n,m,p is almost certainly Hamiltonian, i.e. it contains a Hamilton Cycle almost certainly. Our bounds are tight in the sense that when p is asymptotically smaller than p 0(n,m) then G n,m,p almost surely has a vertex of degree less than 2. Our proof involves new, nontrivial, coupling techniques that allow us to circumvent the edge dependencies in the random intersection model. Interestingly, Hamiltonicity appears well below the general thresholds, of [4], at which G n,m,p looks like a usual random graph. Thus our bounds are much stronger than the trivial bounds implied by those thresholds.
Our results strongly support the existence of a threshold for Hamiltonicity in G n,m,p .
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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, 2nd edn. John Wiley & Sons, Inc., Chichester (2000)
Bollobas, B.: Random Graphs. Academic Press. Inc., New York (1985)
Efthymiou, C., Spirakis, P.G.: On the Existence of Hamiltonian Cycles in Random Intersection Graphs (full version), R.A.C.T.I. Technical Report TR2005/04/02, http://www.cti.gr , Also, DELIS Technical Report, http://delis.upb.de/docs/?subproject=2
Fill, J.A., Scheinerman, 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 Structures and Algorithms 16, 156–176 (2000)
Karoński, M., Scheinerman, E.R., Singer-Cohen, K.: On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing 8, 131–159 (1999)
Komlós, J., Szemerédi, E.: Limit Distributions for the existence of Hamilton cycles in a random graph. Discrete Math. 43, 55–63 (1983)
Korshunov, A.D.: Solution of a problem of P. Erdös and A. Rényi on Hamilton Cycles in non-oriented graphs. Metody Diskr. Anal. Teoriy Upr. Syst. Sb. Trubov Novosibrirsk 31, 17–56 (1977)
Marczewski, E.: Sur deux propriétés des classes d’ensemble. Fun. Math. 33, 303–307 (1945)
McKay, B.D., Wormald, N.C.: The degree sequence of a random graph. I. The models. Random Structures and Algorithms 11, 97–117 (1997)
Nikoletseas, S., Raptopoulos, C., Spirakis, P.: The existence and Efficient construction of Large Independent Sets in General Random Intersection Graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1029–1040. Springer, Heidelberg (2004)
Ross, S.M.: Stochastic Processes, 2nd edn. John Wiley and Sons, Inc., Chichester (1995)
Singer, K.: Random Intersection Graphs, Ph.D. thesis, The Johns Hopkins University (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Efthymiou, C., Spirakis, P.G. (2005). On the Existence of Hamiltonian Cycles in Random Intersection Graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_56
Download citation
DOI: https://doi.org/10.1007/11523468_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)