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 t...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 2(1980), 4 vom: 01. Apr., Seite 341-8
1. Verfasser: Wong, A K (VerfasserIn)
Weitere Verfasser: Ghahraman, D E
Format: Aufsatz
Sprache:English
Veröffentlicht: 1980
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM211011681
003 DE-627
005 20231224012717.0
007 tu
008 231224s1980 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0703.xml 
035 |a (DE-627)NLM211011681 
035 |a (NLM)21868910 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Wong, A K  |e verfasserin  |4 aut 
245 1 0 |a Random graphs  |b structural-contextual dichotomy 
264 1 |c 1980 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 12.11.2019 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Ghahraman, D E  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 2(1980), 4 vom: 01. Apr., Seite 341-8  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:2  |g year:1980  |g number:4  |g day:01  |g month:04  |g pages:341-8 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 2  |j 1980  |e 4  |b 01  |c 04  |h 341-8