Estimating the Joint Probability Distribution of Random Vertices and Arcs by Means of Second-Order Random Graphs
We review the approaches that model a set of Attributed Graphs (AGs) by extending the definition of AGs to include probabilistic information. As a main result, we present a quite general formulation for estimating the joint probability distribution of the random elements of a set of AGs, in which some degree of probabilistic independence between random elements is assumed, by considering only 2nd-order joint probabilities and marginal ones. We show that the two previously proposed approaches based on the random-graph representation (First-Order Random Graphs (FORGs) and Function-Described Graphs (FDGs)) can be seen as two different approximations of the general formulation presented. From this new representation, it is easy to derive that whereas FORGs contain some more semantic (partial) 2nd-order information, FDGs contain more structural 2nd-order information of the whole set of AGs. Most importantly, the presented formulation opens the door to the development of new and more powerful probabilistic representations of sets of AGs based on the 2nd-order random graph concept.
KeywordsJoint Probability Random Graph Random Element Independence Assumption Joint Probability Distribution
- 1.R. Alquézar, F. Serratosa, A. Sanfeliu, “Distance between Attributed Graphs and Function-Described Graphs relaxing 2nd order restrictions”. Proc. SSPR’2000 andSPR’ 2000, Barcelona, Spain, Springer LNCS-1876, pp. 277–286, 2000.Google Scholar
- 5.F. Serratosa, R. Alquezar and A. Sanfeliu, “Efficient algorithms for matching attributed graphs and function-described graphs”, in Proceedings ICPR’2000, 15 th Int. Conf. on Pattern Recognition, Barcelona, Spain, Vol. 2, pp. 871–876, 2000.Google Scholar
- 7.H. Bunke, “Error-tolerant graph matching: a formal framework and algorithms”. Proc. Workshops SSPR’98 & SPR’98, Sydney, Australia, Springer LNCS-1451, pp. 1–14, 1998.Google Scholar