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
DC-RST: a parallel algorithm for random spanning trees in network analytics
Sign Up to like & getrecommendations! Published in 2024 at "Applied Network Science"
DOI: 10.1007/s41109-024-00613-7
Abstract: The Mantel Test, discovered in the 1960s, determines whether two distance metrics on a network are related. More recently, DimeCost, an equivalent test with improved computational complexity, was proposed. It was based on computing a… read more here.
Keywords: rst parallel; walk algorithm; random spanning; parallel algorithm ... See more keywords