Coloring Random Intersection Graphs and Complex Networks

We study the evolution of the chromatic number of a random intersection graph and show that, in a certain range of parameters, these random graphs can be colored optimally with high probability using different greedy algorithms. Experiments on real network data confirm the positive theoretical predictions and suggest that heuristics for the clique and the chromatic number can work hand in hand proving mutual optimality.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  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 .

[3]  Erhard Godehardt,et al.  Two Models of Random Intersection Graphs and their Applications , 2001, Electron. Notes Discret. Math..

[4]  Dudley Stark.  The vertex degree distribution of random intersection graphs , 2004, Random Struct. Algorithms.

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

[6]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[7]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[8]  Martin Thimm,et al.  Comparison of 2D Similarity and 3D Superposition. Application to Searching a Conformational Drug Database , 2004, J. Chem. Inf. Model..

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

[10]  Anusch Taraz,et al.  Efficiently covering complex networks with cliques of similar vertices , 2006, Theor. Comput. Sci..

[11]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[12]  Michael Behrisch,et al.  Component Evolution in Random Intersection Graphs , 2007, Electron. J. Comb..

[13]  Jean-Loup Guillaume,et al.  Bipartite structure of all complex networks , 2004, Inf. Process. Lett..

[14]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  James Allen Fill,et al.  Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models , 2000, Random Struct. Algorithms.

[16]  Till Nierhoff,et al.  Accelerating screening of 3D protein data with a graph theoretical approach , 2003, Bioinform..