Random minimal directed spanning trees and Dickman-type distributions
DOI10.1239/aap/1093962229zbMath1068.60023OpenAlexW2077994897MaRDI QIDQ4662233
Andrew R. Wade, Mathew D. Penrose
Publication date: 30 March 2005
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/10498/1/10498.pdf
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Limit theorems in probability theory (60F99) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Probabilistic analysis of multiple quick select
- The asymptotic distribution of sums of records
- Probability theory of classical Euclidean optimization problems
- Weak laws of large numbers in geometric probability
- Central limit theorems for some graphs in computational geometry.
- On the distribution of points in a poisson dirichlet process
- Quickselect and the Dickman Function
- Density approximation and exact simulation of random variables that are solutions of fixed-point equations
- The Convolution Powers of the Dickman Function
- The stationary distribution of the infinitely-many neutral alleles diffusion model
- On the central role of the scale invariant Poisson processes on (0,infty)
- On the Asymptotic Distribution of Large Prime Factors
- On the Distribution of the Number of Admissible Points in a Vector Random Sample
- Random Geometric Graphs
- On a random directed spanning tree
- Random minimal directed spanning trees and Dickman-type distributions
- Perpetuities with thin tails
This page was built for publication: Random minimal directed spanning trees and Dickman-type distributions