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
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths ...
peer reviewedWe study the total $\alpha$-powered length of the rooted edges in a random minimal dire...
peer reviewedWe study the total $\alpha$-powered length of the rooted edges in a random minimal dire...
In Bhatt and Roy's minimal directed spanning tree construction for n random points in the unit squar...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest ne...
We study the total $\alpha$-powered length of the rooted edges in a random minimal directed spanning...
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths ...
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths ...
peer reviewedWe study the total $\alpha$-powered length of the rooted edges in a random minimal dire...
peer reviewedWe study the total $\alpha$-powered length of the rooted edges in a random minimal dire...
In Bhatt and Roy's minimal directed spanning tree construction for n random points in the unit squar...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
In Bhatt and Roy's minimal directed spanning tree construction for a random, partially ordered set o...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
Suppose that, under the action of gravity, liquid drains through the unit d-cube via a minimal-lengt...
We consider several random spatial graphs of the nearest-neighbour type, including the k- nearest ne...
We study the total $\alpha$-powered length of the rooted edges in a random minimal directed spanning...
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths ...
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths ...
peer reviewedWe study the total $\alpha$-powered length of the rooted edges in a random minimal dire...
peer reviewedWe study the total $\alpha$-powered length of the rooted edges in a random minimal dire...