The longest edge of the random minimal spanning tree
From MaRDI portal
Recommendations
Cited in
(76)- Robust estimation of location and scatter by pruning the minimum spanning tree
- Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
- Maker-breaker games on random geometric graphs
- On the probability of the existence of fixed-size components in random geometric graphs
- Bridged Hamiltonian cycles in sub-critical random geometric graphs
- Topological properties of random wireless networks
- Cube versus torus models and the Euclidean minimum spanning tree constant
- Nonuniform random geometric graphs with location-dependent radii
- Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints
- Localization game for random geometric graphs
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- Inapplicability of asymptotic results on the minimal spanning tree in statistical testing
- On the connectivity and diameter of small-world networks
- The acquaintance time of (percolated) random geometric graphs
- A fractal dimension for measures via persistent homology
- Convergence rates for estimators of geodesic distances and Fréchet expectations
- Note on the structure of Kruskal's algorithm
- An upper bound for the average length of the euclidean minimum spanning tree
- Connectivity of soft random geometric graphs
- scientific article; zbMATH DE number 1340281 (Why is no real title available?)
- The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
- Mobile geometric graphs: detection, coverage and percolation
- Thresholding random geometric graph properties motivated by ad hoc sensor networks
- Criteria for Poisson process convergence with applications to inhomogeneous Poisson-Voronoi tessellations
- Random minimal directed spanning trees and Dickman-type distributions
- Theoretical Aspects of Graph Models for MANETs
- When does the union of random spherical caps become connected?
- Central limit theorems for \(k\)-nearest neighbour distances
- BOOTSTRAP PERCOLATION ON RANDOM GEOMETRIC GRAPHS
- Extremal lifetimes of persistent cycles
- Random Simplicial Complexes: Models and Phenomena
- Monotone properties of random geometric graphs have sharp thresholds
- Hitting Time Theorems for Random Matrices
- Sharp threshold for embedding balanced spanning trees in random geometric graphs
- On the fundamental limits of topology control in ad hoc networks
- On the cover time and mixing time of random geometric graphs
- Hamilton cycles in random geometric graphs
- On the contractibility of random Vietoris-Rips complexes
- Homological connectivity in random Čech complexes
- Near-minimal spanning trees: A scaling exponent in probability models
- Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes
- A strong law for the longest edge of the minimal spanning tree
- Poisson approximation with applications to stochastic geometry
- scientific article; zbMATH DE number 7255037 (Why is no real title available?)
- Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
- Extremes on trees
- Covering algorithms, continuum percolation and the geometry of wireless networks
- Isolation and connectivity in random geometric graphs with self-similar intensity measures
- Geometry of the minimal spanning tree of a random 3-regular graph
- scientific article; zbMATH DE number 912696 (Why is no real title available?)
- Large deviations for the volume of \(k\)-nearest neighbor balls
- Connectivity of inhomogeneous random graphs
- Resistant estimation of multivariate location using minimum spanning trees
- Burning graphs: a probabilistic perspective
- Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
- Bootstrap percolation in random geometric graphs
- Isotropic random geometric networks in two dimensions with a penetrable cavity
- The longest edge in discrete and continuous long-range percolation
- Sharpness in the \(k\)-nearest-neighbours random geometric graph model
- Limit laws for large \(k\)th-nearest neighbor balls
- On the treewidth of random geometric graphs and percolated grids
- Flocking with general local interaction and large population
- Cops and robbers on geometric graphs
- Poisson process approximation under stabilization and Palm coupling
- Connectivity of random geometric graphs related to minimal spanning forests
- On the typical case complexity of graph optimization
- On the long edges in the shortest tour through \(n\) random points
- On the connectivity threshold for general uniform metric spaces
- A note on interference in random networks
- Asymptotics for weighted minimal spanning trees on random points
- Plane and planarity thresholds for random geometric graphs
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Connectivity of random k-nearest-neighbour graphs
- Connectivity threshold of Bluetooth graphs
- Clique colourings of geometric graphs
- Optimal Cheeger cuts and bisections of random geometric graphs
This page was built for publication: The longest edge of the random minimal spanning tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364391)
