The longest edge of the random minimal spanning tree
From MaRDI portal
Publication:1364391
DOI10.1214/aoap/1034625335zbMath0884.60042OpenAlexW2169293240WikidataQ104631545 ScholiaQ104631545MaRDI QIDQ1364391
Publication date: 26 January 1998
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1034625335
Geometric probability and stochastic geometry (60D05) Trees (05C05) Extreme value theory; extremal stochastic processes (60G70) Combinatorial optimization (90C27)
Related Items
Asymptotics for weighted minimal spanning trees on random points ⋮ Central limit theorems for \(k\)-nearest neighbour distances ⋮ Criteria for Poisson process convergence with applications to inhomogeneous Poisson-Voronoi tessellations ⋮ Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model ⋮ Connectivity of soft random geometric graphs ⋮ Cops and Robbers on Geometric Graphs ⋮ Topological properties of random wireless networks ⋮ Extremal lifetimes of persistent cycles ⋮ On the cover time and mixing time of random geometric graphs ⋮ Random Simplicial Complexes: Models and Phenomena ⋮ Note on the structure of Kruskal's algorithm ⋮ Hitting Time Theorems for Random Matrices ⋮ Homological connectivity in random Čech complexes ⋮ Unnamed Item ⋮ On the probability of the existence of fixed-size components in random geometric graphs ⋮ Connectivity of inhomogeneous random graphs ⋮ Optimal Cheeger cuts and bisections of random geometric graphs ⋮ Diameter and broadcast time of random geometric graphs in arbitrary dimensions ⋮ Isotropic random geometric networks in two dimensions with a penetrable cavity ⋮ Robust estimation of location and scatter by pruning the minimum spanning tree ⋮ On the contractibility of random Vietoris-Rips complexes ⋮ Poisson process approximation under stabilization and Palm coupling ⋮ A note on interference in random networks ⋮ Bridged Hamiltonian cycles in sub-critical random geometric graphs ⋮ Large deviations for the volume of \(k\)-nearest neighbor balls ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Bootstrap percolation in random geometric graphs ⋮ A Fractal Dimension for Measures via Persistent Homology ⋮ Covering algorithms, continuum percolation and the geometry of wireless networks ⋮ Convergence rates for estimators of geodesic distances and Frèchet expectations ⋮ Mobile geometric graphs: detection, coverage and percolation ⋮ On the connectivity threshold for general uniform metric spaces ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ Theoretical Aspects of Graph Models for MANETs ⋮ Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes ⋮ Clique colourings of geometric graphs ⋮ On the fundamental limits of topology control in ad hoc networks ⋮ Resistant estimation of multivariate location using minimum spanning trees ⋮ Nonuniform random geometric graphs with location-dependent radii ⋮ BOOTSTRAP PERCOLATION ON RANDOM GEOMETRIC GRAPHS ⋮ Unnamed Item ⋮ Hamilton cycles in random geometric graphs ⋮ When does the union of random spherical caps become connected? ⋮ Burning graphs: a probabilistic perspective ⋮ Connectivity of random k-nearest-neighbour graphs ⋮ Monotone properties of random geometric graphs have sharp thresholds ⋮ Extremes on trees ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ On the connectivity and diameter of small-world networks ⋮ Isolation and connectivity in random geometric graphs with self-similar intensity measures ⋮ Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs ⋮ Flocking with general local interaction and large population ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ A strong law for the longest edge of the minimal spanning tree ⋮ Plane and planarity thresholds for random geometric graphs ⋮ On the treewidth of random geometric graphs and percolated grids ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem ⋮ Poisson approximation with applications to stochastic geometry ⋮ Maker‐breaker games on random geometric graphs ⋮ On the typical case complexity of graph optimization ⋮ The acquaintance time of (percolated) random geometric graphs ⋮ Inapplicability of asymptotic results on the minimal spanning tree in statistical testing ⋮ Localization game for random geometric graphs ⋮ Limit laws for large th-nearest neighbor balls ⋮ Connectivity threshold of Bluetooth graphs ⋮ The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
