Distance measure in a weighted, fully connected network
조회 수: 1 (최근 30일)
이전 댓글 표시
Hey,
I have a network where the adjacency matrix (A) is a transformation of the correlation coefficients and self-edges are removed
A=0.5*(correlation + 1)
Now I need a distance measure to calculate betweenness and thought about transforming it to a distance d by
d=(1-A)^2
How can I check whether the triangle inequality holds for this distance? All other conditions of a metric are satisfied, but I'm unsure how to prove this. I need the distance to calculate betweenness scores for the network and the applied distance measure spreads the distribution of distance so that I get results other than 0.
However, my problem of proving whether the triangle inequality holds remains.
Thank you, Chris
댓글 수: 0
답변 (0개)
참고 항목
카테고리
Help Center 및 File Exchange에서 Hypothesis Tests에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!