Addendum to “The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph”

Abstract

Random Structures & AlgorithmsVolume 28, Issue 4 p. 511-512 Free Access Addendum to “The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph” Svante Janson, Corresponding Author Svante Janson [email protected] Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden Svante Janson, Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden Johan Wästlund, Department of Mathematics, Linköping University, SE-581 83 Linköping, SwedenSearch for more papers by this authorJohan Wästlund, Corresponding Author Johan Wästlund [email protected] Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden Svante Janson, Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden Johan Wästlund, Department of Mathematics, Linköping University, SE-581 83 Linköping, SwedenSearch for more papers by this author Svante Janson, Corresponding Author Svante Janson [email protected] Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden Svante Janson, Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden Johan Wästlund, Department of Mathematics, Linköping University, SE-581 83 Linköping, SwedenSearch for more papers by this authorJohan Wästlund, Corresponding Author Johan Wästlund [email protected] Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden Svante Janson, Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06 Uppsala, Sweden Johan Wästlund, Department of Mathematics, Linköping University, SE-581 83 Linköping, SwedenSearch for more papers by this author First published: 26 April 2006 https://doi.org/10.1002/rsa.20122Citations: 4AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL No abstract is available for this article. References 1 N.H. Abel, Beweis eines Ausdruckes, von welchem die Binomial-Formel ein einzelner Fall ist, J Reine Angew Math 1 ( 1826), 159– 160. The article is available at http://dz-srv1.sub.uni-goettingen.de/cache/toc/D270794.html. 2 D. Aldous, The ζ (2) limit in the random assignment problem, Random Struct Algor 18 ( 2001), 381– 418. 3 A.M. Frieze, On the value of a minimal spanning tree problem, Discrete Appl Math 10 ( 1985), 47– 56. 4 R. van der Hofstad, G. Hooghiemstra, P. Van Mieghem, Size and weight of shortest path trees with exponential link weights, Combin Probab Comput, to appear. 5 R. van der Hofstad, G. Hooghiemstra, P. Van Mieghem, The weight of the shortest path tree, Random Struct Algor, to appear. 6 S. Janson, The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph, Random Struct Algor 7 ( 1995), 337– 355. 7 J. Wästlund, Evaluation of Janson's constant for the variance in the random minimum spanning tree problem, Linköping Stud Math 7 ( 2005); http://www.ep.liu.se/ea/lsm/2005/007/. 8 J. Wästlund, The variance and higher moments in the random assignment problem, Linköping Stud Math 8 ( 2005); http://www.ep.liu.se/ea/lsm/2005/008/. Citing Literature Volume28, Issue4July 2006Pages 511-512 ReferencesRelatedInformation