Abstract
Consider n nodes \(\{X_i\}_{1 \le i \le n}\) independently and identically distributed (i.i.d.) across N cities located within the unit square S. Each city is modelled as an \(r_n \times r_n\) square, and \(\mathrm{{MSTC}}_n\) denotes the weighted length of the minimum spanning tree containing all the n nodes, where the edge length between nodes \(X_i\) and \(X_j\) is weighted by a factor that depends on the individual locations of \(X_i\) and \(X_j.\) We use approximation methods to obtain variance estimates for \(\mathrm{{MSTC}}_n\) and prove that if the cities are well connected in a certain sense, then \(\mathrm{{MSTC}}_n\) appropriately centred and scaled converges to zero in probability. Using the above proof techniques we also study \(\mathrm{{MST}}_n,\) the length of the minimum weighted spanning tree for nodes distributed throughout the unit square S with location-dependent edge weights. In this case, the variance of \(\mathrm{{MST}}_n\) grows at most as a power of the logarithm of n and we use a subsequence argument to get almost sure convergence of \(\mathrm{{MST}}_n,\) appropriately centred and scaled.
Similar content being viewed by others
References
Abdel-Wahab, H., Stoica, I., Sultan, F.: A simple algorithm for computing minimum spanning trees in the internet. Inform. Comput. Sci. 101, 47–69 (1997)
Alexander, K.: The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees. Ann. Appl. Probab. 6, 466–494 (1996)
Alon, N., Spencer, J.: The Probabilistic Method. Wiley, New York (2008)
Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Proc. Camb. Philos. Soc. 55, 299–327 (1959)
Chatterjee, S., Sen, S.: Minimal spanning trees and Stein’s method. Ann. Appl. Probab. 27, 1588–1645 (2017)
Cormen, T., Leiserson, C.E., Rivest, R.R., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill, Cambridge (2009)
Erlebach, T., Hoffmann, M., Krizanc, D., Mihalák, M., Raman. R.: Computing minimum spanning trees with uncertainty. In: Symposium on Theoretical Aspects of Computer Science (2008) Bordeaux, pp. 277–288 (2008)
Kesten, H., Lee, S.: The central limit theorem for weighted minimal spanning trees on random points. Ann. Appl. Probab. 6, 495–527 (1996)
Penrose, M., Yukich, J.: Weak laws of large numbers in geometric probability. Ann. Appl. Probab. 13, 277–303 (2003)
Penrose, M.: Gaussian limits for random geometric measures. Electron. J. Probab. 12, 989–1035 (2007)
Steele, J.M.: Growth rates of Euclidean minimal spanning trees with power weighted edges. Ann. Probab. 16, 1767–1787 (1988)
Steele, J.M.: Probability and problems in Euclidean combinatorial optimization. Stat. Sci. 8, 48–56 (1993)
Steele, J.M.: Probability Theory and Combinatorial Optimization. SIAM, Philadelphia (1997)
Supowit, K.J., Plaisted, D.A., Reingold, E.M.: Heuristics for weighted perfect matching. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 398–419 (1980)
Acknowledgements
I thank Professors Rahul Roy, Jacob van den Berg, Anish Sarkar, Federico Camia and the referees for crucial comments that led to an improvement of the paper. I also thank Professors Rahul Roy, Federico Camia and IMSc for my fellowships.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ganesan, G. Minimum Spanning Trees Across Well-Connected Cities and with Location-Dependent Weights. Commun. Math. Stat. 10, 1–50 (2022). https://doi.org/10.1007/s40304-019-00201-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40304-019-00201-7