We consider the problem of approximating a given element f from a Hilbert space $\scr {H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical ...

We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number ...