论文信息 - Random Intersection Graphs and Classification

Random Intersection Graphs and Classification

We study properties of random intersection graphs generated by a random bipartite graph. We focus on the connectedness of these random intersection graphs and give threshold functions for this property and results for the size of the largest components in such graphs. The application of intersection graphs to find clusters and to test their randomness in sets of non-metric data is shortly discussed.

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

[2] Jerzy Jaworski,et al. The degree of a typical vertex in generalized random intersection graph models , 2006, Discret. Math..

[3] Erhard Godehardt,et al. On the connectivity of a random interval graph , 1996 .

[4] H. Bock. Probabilistic models in cluster analysis , 1996 .

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

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

[7] Otto Opitz,et al. Exploratory Data Analysis in Empirical Research , 2002 .

[8] Zbigniew Palka,et al. Remarks on a general model of a random digraph , 2002, Ars Comb..

[9] Erhard Godehardt,et al. Graphs as Structural Models , 1988 .

[10] Jerzy Jaworski,et al. On a Random Digraph , 1987 .

[11] Jeanette P. Schmidt,et al. Component structure in the evolution of random hypergraphs , 1985, Comb..