MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
    
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. – Louigi Addario-Berry Sep 28 '10 at 1:55
1  
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. – R Hahn Sep 28 '10 at 2:21

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.