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.05085OpenAlexW2003914969MaRDI 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
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17)
Related Items
A concentration inequality for the facility location problem, Successive minimum spanning trees, Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes, Unnamed Item, Models of random subtrees of a graph, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, On the Length of a Random Minimum Spanning Tree, Minimum Cost Matching in a Random Graph with Random Costs, On the number of isolated vertices in a growing random graph, 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, Tail bound for the minimal spanning tree of a complete graph., A randomly weighted minimum spanning tree with a random cost constraint, On the Difference of Expected Lengths of Minimum Spanning Trees, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs, Local tail bounds for functions of independent random variables, Monotonicity, asymptotic normality and vertex degrees in random graphs, Asymptotics of integrals of Betti numbers for random simplicial complex processes, The order of the giant component of random hypergraphs, Weight of a link in a shortest path tree and the Dedekind Eta function, On finding a minimum spanning tree in a network with random weights, Geometry of the minimal spanning tree of a random 3-regular graph, Cross-Multiplicative Coalescent Processes and Applications, The central limit theorem for weighted minimal spanning trees on random points, Coalescent random forests, On the rank of a random binary matrix, Typical values of extremal-weight combinatorial structures with independent symmetric weights
Cites Work
