Given two trees with weighted edges, what kind of similarity or distance measures are there between these two trees? Note that the number of nodes in each tree need not be the same. Are there any similarity measures that can be related to the Laplacian of these tree structures?
$\begingroup$
$\endgroup$
2
-
$\begingroup$ My answer to this question (mathoverflow.net/questions/38305/similarity-of-weighted-graphs/…) is also applicable to your question, in case that answer is useful to you. $\endgroup$– Louigi Addario-BerryCommented Sep 28, 2010 at 1:55
-
1$\begingroup$ Susan Holmes has studied tree metrics in the case where the trees have the same number of leaves (but not necessarily vertices): www-stat.stanford.edu/~susan/papers/lap.pdf. $\endgroup$– R HahnCommented Sep 28, 2010 at 2:21
Add a comment
|