On the nearest neighbor tree
Curien
Nicolas
Let points X_1,X_2, … be i.d.d. uniform over [0,1]^d. When a new point X_n arrives, it connects to the nearest point in X1,…,X_{n-1}.
Mon compte
Pas encore inscrit ?
Let points X_1,X_2, … be i.d.d. uniform over [0,1]^d. When a new point X_n arrives, it connects to the nearest point in X1,…,X_{n-1}.
Random planar maps have been the subject of numerous studies over the last years. They are instance of stationary and reversible random planar maps exhibiting a non-conventional geometry at