CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1980 vol.2 Issue No.04 - April
Issue No.04 - April (1980 vol.2)
Andrew K. C. Wong , MEMBER, IEEE, Department of Systems Design, University of Waterloo, Waterloo, Ont., Canada.
David E. Ghahraman , MEMBER, IEEE, Institute of Technology, Carnegie-Mellon University, Pittsburgh, PA 15213; Megatest Corporation, Santa Clara, CA.
A formal definition of random graphs is introduced which is applicable to graphical pattern recognition problems. The definition is used to formulate rigorously the structural-contextual dichotomy of random graphs. The probability of outcome graphs is expressed as the product of two terms, one due to the statistical variability of structure among the outcome graphs and the other due to their contextual variability. Expressions are obtained to estimate the various probability, typicality, and entropy measures. The members in an ensemble of signed digraphs are interpreted as outcome graphs of a random graph. The synthesized random graph is used to quantify the structural, contextual, and overall typicality of the outcome graphs with respect to the random graph.
Andrew K. C. Wong, David E. Ghahraman, "Random Graphs: Structural-Contextual Dichotomy", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.2, no. 4, pp. 341-348, April 1980, doi:10.1109/TPAMI.1980.4767033