Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)
Sign Up to like & getrecommendations! Published in 2020 at "Networks"
DOI: 10.1002/net.21949
Abstract: We consider the network analytics problem of comparing two distance metrics on the same set of n entities. The classical solution to this problem is the Mantel test, which uses permutation testing to accept or… read more here.
Keywords: distance metrics; uniform random; spanning trees; random spanning ... See more keywords