A Guided Tour in Random Intersection Graphs

Random graphs, introduced by P. Erdős and A. Renyi in 1959, still attract a huge amount of research in the communities of Theoretical Computer Science, Algorithms, Graph Theory, Discrete Mathematics and Statistical Physics. This continuing interest is due to the fact that, besides their mathematical beauty, such graphs are very important, since they can model interactions and faults in networks and also serve as typical inputs for an average case analysis of algorithms. The modeling effort concerning random graphs has to show a plethora of random graph models; some of them have quite elaborate definitions and are quite general, in the sense that they can simulate many other known distributions on graphs by carefully tuning their parameters.

[1]  Tomasz Luczak.  The chromatic number of random graphs , 1991, Comb..

[2]  B. Reed.  Graph Colouring and the Probabilistic Method , 2001 .

[3]  Anusch Taraz,et al.  Coloring Random Intersection Graphs and Complex Networks , 2008, SIAM J. Discret. Math..

[4]  Erhard Godehardt,et al.  Two Models of Random Intersection Graphs for Classification , 2003 .

[5]  Yilun Shang,et al.  On the Isolated Vertices and Connectivity in Random Intersection Graphs , 2011 .

[6]  Paul G. Spirakis,et al.  Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs , 2005, ISAAC.

[7]  Paul G. Spirakis,et al.  Sharp thresholds for Hamiltonicity in random intersection graphs , 2010, Theor. Comput. Sci..

[8]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings , 2009, MFCS.

[9]  Katarzyna Rybarczyk,et al.  Equivalence of a random intersection graph and G(n,p) , 2009, Random Struct. Algorithms.

[10]  James Allen Fill,et al.  Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models , 2000 .

[11]  Dudley Stark.  The vertex degree distribution of random intersection graphs , 2004 .

[12]  Paul G. Spirakis,et al.  Large independent sets in general random intersection graphs , 2008, Theor. Comput. Sci..

[13]  Alan M. Frieze,et al.  On the independence number of random graphs , 1990, Discret. Math..

[14]  Paul G. Spirakis,et al.  On the independence number and Hamiltonicity of uniform random intersection graphs , 2011, Theor. Comput. Sci..

[15]  Paul G. Spirakis,et al.  Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs , 2012, MFCS.

[16]  Vladimiro Sassone,et al.  Mathematical Foundations of Computer Science 2012 , 2012, Lecture Notes in Computer Science.

[17]  Paul G. Spirakis,et al.  Expander properties and the cover time of random intersection graphs , 2009, Theor. Comput. Sci..

[18]  Edward R. Scheinerman,et al.  On Random Intersection Graphs: The Subgraph Problem , 1999, Combinatorics, Probability and Computing.

[19]  Paul G. Spirakis,et al.  Colouring Non-sparse Random Intersection Graphs , 2009, MFCS.

[20]  Colin Cooper,et al.  The cover time of sparse random graphs , 2007 .