Random minimal directed spanning trees and Dickman-type distributions

By Mathew D. Penrose, A. Wade. Advances in Applied Probability, 2004

64 citations recorded by the source corpus.

In Bhatt and Roy's minimal directed spanning tree construction for n random points in the unit square, all edges must be in a south-westerly direction and there must be a directed path from each vertex to the root placed at the origin. We identify the limiting distributions (for large n) for the total length of rooted edges, and also for the maximal length of all edges in the tree. These limit distributions have been seen previously in analysis of the Poisson-Dirichlet distribution and elsewhere; they are expressed in terms of Dickman's function, and their properties are discussed in some detail.

Subfields: Applied Mathematics, Artificial Intelligence, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/958e3327c8ca1e9db69999c83665605bf7c3c366

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Charles Bordenave
  2. François Baccelli

In Artificial Intelligence

  1. Charles Bordenave
  2. François Baccelli
  3. F. Augeri

In Mathematical Physics

  1. Charles Bordenave
  2. François Baccelli
  3. Djalil CHAFAÏ
  4. F. Augeri
  5. Benoît Collins

Citations in the corpus