The lower tail of the random minimum spanning tree

zbMATH Open1113.05090MaRDI QIDQ870089FDOQ870089

Authors: Abraham D. Flaxman 

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127479

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Tail bound for the minimal spanning tree of a complete graph.
• On random minimum length spanning trees
• On the length of a random minimum spanning tree
• On the value of a random minimum spanning tree problem
• A randomly weighted minimum spanning tree with a random cost constraint

zbMATH Keywords

random variabledeviation probabilitylog-probability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited In (2)

• On the length of a random minimum spanning tree
• Typical values of extremal-weight combinatorial structures with independent symmetric weights

This page was built for publication: The lower tail of the random minimum spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870089)