Random Graphs: Structural-Contextual Dichotomy

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.

[1]  Charles T. Zahn,et al.  An Algorithm for Noisy Template Matching , 1974, IFIP Congress.

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Ugo Montanari,et al.  Optimization Methods in Image Processing , 1974, IFIP Congress.

[4]  Andrew K. C. Wong,et al.  Typicality, Diversity, and Feature Pattern of an Ensemble , 1975, IEEE Transactions on Computers.

[5]  Michael G. Thomason,et al.  Syntactic Methods in Pattern Recognition , 1982 .

[6]  Fred S. Roberts,et al.  Building and Analyzing an Energy Demand Signed Digraph , 1973 .

[7]  Stephen Soule,et al.  Entropies of Probabilistic Grammars , 1974, Inf. Control..

[8]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[9]  Martin A. Fischler,et al.  The Representation and Matching of Pictorial Structures , 1973, IEEE Transactions on Computers.

[10]  Fred S. Roberts,et al.  Signed Digraphs and the Growing Demand for Energy , 1971 .

[11]  Alan C. Shaw,et al.  Parsing of Graph-Representable Pictures , 1970, JACM.

[12]  Frederick Hayes-Roth,et al.  Uniform Representations of Structured Patterns and an Algorithm for the Induction of Contingency-Response Rules , 1977, Inf. Control..

[13]  Fred S. Roberts,et al.  Pulse processes on signed digraphs: a tool for analyzing energy demand , 1972 .

[14]  Theodosios Pavlidis,et al.  Representation of figures by labeled graphs , 1972, Pattern Recognit..

[15]  Magoroh Maruyama,et al.  THE SECOND CYBERNETICS Deviation-Amplifying Mutual Causal Processes , 1963 .

[16]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey-Part II , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  T. B. Boffey,et al.  Applied Graph Theory , 1973 .

[18]  Andrew K. C. Wong,et al.  Graph Optimal Monomorphism Algorithms , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Harry G. Barrow,et al.  SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURES , 1972 .

[20]  Andrew K. C. Wong,et al.  Computer Perception of Complex Patterns , 1971, IJCAI.

[21]  L. L. Campbell,et al.  On Measures of Information and Their Characterizations (J. Aczél and Z. Daróczy) , 1977 .