On a random directed spanning tree
From MaRDI portal
Recommendations
- On the total length of the random minimal directed spanning tree
- Random minimal directed spanning trees and Dickman-type distributions
- Limit theorems for random spatial drainage networks
- Rooted edges of a minimal directed spanning tree on random points
- The radial spanning tree of a Poisson point process
Cites work
- Asymptotics for Euclidean minimal spanning trees on random points
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- scientific article; zbMATH DE number 3824228 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- scientific article; zbMATH DE number 1254188 (Why is no real title available?)
- scientific article; zbMATH DE number 3354425 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- scientific article; zbMATH DE number 3107192 (Why is no real title available?)
- Models of fractal river basins
- Random Plane Networks
- The central limit theorem for weighted minimal spanning trees on random points
Cited in
(16)- Geometry of the minimal spanning tree of a random 3-regular graph
- Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
- Convergence to scale-invariant Poisson processes and applications in Dickman approximation
- Dickman approximation in simulation, summations and perpetuities
- The radial spanning tree of a Poisson point process
- Central limit theorems for the radial spanning tree
- Limit theorems for random spatial drainage networks
- Asymptotics of geometrical navigation on a random set of points in the plane
- Explicit laws of large numbers for random nearest-neighbour-type graphs
- Maxima-finding algorithms for multidimensional samples: A two-phase approach
- Random minimal directed spanning trees and Dickman-type distributions
- Traffic flow densities in large transport networks
- Rooted edges of a minimal directed spanning tree on random points
- On the total length of the random minimal directed spanning tree
- The Dickman–Goncharov distribution
- Gaussian approximation for rooted edges in a random minimal directed spanning tree
This page was built for publication: On a random directed spanning tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464163)