Summary
In cluster analysis, the random graph model G n,p and G n,p-based multigraph models have been used for purposes of statistical modelling of data and testing the randomness of outlined clusters. While being appropriate for non-metric data, such models supposing independence of all edges do not take into account the triangle inequality which is valid for metric data. We will introduce graph models I n,dand I t,n,(d1,…,dt) for random intersection graphs in R 1 and multigraphs in R t under which the triangle inequality holds. We derive limit theorems for the distribution of random variables which describe important properties of these random intersection graphs. While being asymptotically equivalent for some properties like the limit distribution of the number of isolated points, the G n,p-model and the I n,d-model differ in numerous aspects.
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
BARBOUR, A.D., HOLST, L., JANSON, S. (1992): Poisson approximations. Clarendon Press, Oxford.
BOCK, H.H. (1980): Clusteranalyse - Überblick und neuere Entwicklungen. OR Spektrum, 1, 211–232.
BOLLOBÁS, B. (1985): Random graphs. Academic Press, London - New York Tokyo.
ERDŐS, P., RÉNYI, A. (1960): On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5, 17–61.
GILBERT, E.N. (1959): Random graphs. Annals of Mathematical Statistics, 30, 114I-1I44.
GODEHARDT, E. (1990): Graphs as structural models: The application of graphs and multigraphs in cluster analysis (Advances in systems analysis, Vol. 4). Friedr. Vieweg & Sohn, Braunschweig - Wiesbaden.
GODEHARDT, E. (1993): Probability models for random multigraphs with applications in cluster analysis. Annals of Discrete Mathematics, 55, 93–108.
GODEHARDT, E., HORSCH, A. (1994): Testing of data structures with graph- theoretical models, in: Bock, H.H., Lenski, W., Richter, M.M. (eds.): Information systems and data analysis (Proceedings 17th Annual Conference of the Gesellschaft für Klassifikation e.V., Kaiserslautern, March 3–5, 1993). Springer, Berlin - Heidelberg - New York, 226–241
LING, R.F. (1973): A probability theory of cluster analysis. Journal of the American Statistical Association, 68, 159–164-
LUCZAK, T. (1990): On the equivalence of two basic models of random graphs. In: M. Karoński, J. Jaworski, A. Ruciiiski (eds.): Random Graphs ‘87. John Wiley & Sons, New York - Chichester - Brisbane, 151–157.
KENNEDY, J.W. (1976): Random clumps, graphs, and polymer solutions. In: Y. Alavi, D.R. Lick (eds.): Theory and Applications of Graphs. Springer, Berlin - Heidelberg - New York, 314–329.
ROACH, S.A. (1968): The theory of random clumping. Methuen & Co, London.
ROBERTS, F.S. (1976): Discrete mathematical models. Prentice-Hall, Engle- wood Cliffs.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Godehardt, E., Horsch, A. (1996). Graph-Theoretic Models for Testing the Homogeneity of Data. In: Gaul, W., Pfeifer, D. (eds) From Data to Knowledge. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79999-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-79999-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60354-2
Online ISBN: 978-3-642-79999-0
eBook Packages: Springer Book Archive