Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)

DOI10.1002/net.21949zbMath1527.90069OpenAlexW3035488136MaRDI QIDQ6092629

Unnamed Author, Unnamed Author, Dinesh P. Mehta

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21949

zbMATH Keywords

correlation coefficienttransportation networksrandom spanning treesdistance metricsnetwork analyticsMantel test

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical programming approaches for classes of random network problems
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Downsampling of Signals on Graphs Via Maximum Spanning Trees
• Probability and Computing

This page was built for publication: Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)