A Guided Tour in Random Intersection Graphs
Random graphs, introduced by P. Erdős and A. Rényi 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.
KeywordsRandom Graph Chromatic Number Hamilton Cycle Maximum Clique Intersection Graph
Unable to display preview. Download preview PDF.
- 2.Cooper, C., Frieze, A.: The Cover Time of Sparse Random Graphs. In: Random Structures and Algorithms, vol. 30, pp. 1–16. John Wiley & Sons, Inc. (2007)Google Scholar
- 6.Godehardt, E., Jaworski, J.: Two models of Random Intersection Graphs for Classification. In: Opitz, O., Schwaiger, M. (eds.). Studies in Classification, Data Analysis and Knowledge Organisation, pp. 67–82. Springer, Heidelberg (2002)Google Scholar
- 8.Łuczak, T.: The chromatic number of random graphs. Combinatorica 11(1), 45–54 (2005)Google Scholar
- 14.Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer (2002)Google Scholar
- 17.Shang, Y.: On the Isolated Vertices and Connectivity in Random Intersection Graphs. International Journal of Combinatorics 2011, Article ID 872703 (2011), doi:10.1155/2011/872703Google Scholar
- 18.Singer-Cohen, K.B.: Random Intersection Graphs. PhD thesis, John Hopkins University (1995)Google Scholar