The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
From MaRDI portal
Publication:4858241
DOI10.1002/rsa.3240070406zbMath0844.05085MaRDI QIDQ4858241
Publication date: 12 December 1995
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240070406
05C05: Trees
05C80: Random graphs (graph-theoretic aspects)
60F17: Functional limit theorems; invariance principles
Related Items
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, On the Length of a Random Minimum Spanning Tree, Diameter of the Stochastic Mean-Field Model of Distance, A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks, Coalescent random forests, Tail bound for the minimal spanning tree of a complete graph., The central limit theorem for weighted minimal spanning trees on random points, On the rank of a random binary matrix, On the number of isolated vertices in a growing random graph, Local tail bounds for functions of independent random variables, Monotonicity, asymptotic normality and vertex degrees in random graphs, Minimum Cost Matching in a Random Graph with Random Costs, Unnamed Item, The order of the giant component of random hypergraphs, Weight of a link in a shortest path tree and the Dedekind Eta function, On the Difference of Expected Lengths of Minimum Spanning Trees
Cites Work
