Random minimum spanning tree
id:
random-minimum-spanning-tree-266-3585395
title:
Random minimum spanning tree
text:
In mathematics, a random minimum spanning tree may be formed by assigning independent random weights from some distribution to the edges of an undirected graph, and then constructing the minimum spanning tree of the graph. When the given graph is a complete graph on n vertices, and the edge weights have a continuous distribution function whose derivative at zero is D > 0, then the expected weight of its random minimum spanning trees is bounded by a constant, rather than growing as a function of
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Random_minimum_spanning_tree
date created:
date modified:
2024-01-04T08:09:59Z
main entity:
{"identifier":"Q7291978","url":"https://www.wikidata.org/entity/Q7291978"}
image:
fields total:
13
integrity:
13