We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
This paper introduces a tracking method for the well known local MSER (Maximally Stable Extremal Region) detector. The component tree is used as an efficient data structure, which...
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...
Paul W. Fieguth, William W. Irving, Alan S. Willsk...