Approximations for the Random Minimal Spanning Tree With Application to Network Provisioning

Loading...
Thumbnail Image
Penn collection
Operations, Information and Decisions Papers
Degree type
Discipline
Subject
facilities/equipment planning: network planning
networks/graphs
stochastic: random minimal spanning trees
tree algorithms: approximations to MSTs
Other Mathematics
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Jain, Anjani
Mamer, John W
Contributor
Abstract

This paper considers the problem of determining the mean and distribution of the length of a minimal spanning tree (MST) on an undirected graph whose arc lengths are independently distributed random variables. We obtain bounds and approximations for the MST length and show that our upper bound is much tighter than the naive bound obtained by computing the MST length of the deterministic graph with the respective means as arc lengths. We analyze the asymptotic properties of our approximations and establish conditions under which our bounds are asymptotically optimal. We apply these results to a network provisioning problem and show that the relative error induced by using our approximations tends to zero as the graph grows large.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1988
Journal title
Operation Research
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection