Subtractive random forests

arXiv2210.10544MaRDI QIDQ6506832FDOQ6506832

Authors: Nicolas Broutin, Luc Devroye, Gábor Lugosi, Roberto I. Oliveira

Abstract: Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer

i l e 0

is the root of a tree. Vertices labeled by positive integers

n g e 1

are attached sequentially such that the parent of vertex

n

is

n - Z_{n}

, where the

Z_{n}

are i.i.d. random variables taking values in

m a t h b b N

. We study several characteristics of the resulting random forest. In particular, we establish bounds for the expected tree sizes, the number of trees in the forest, the number of leaves, the maximum degree, and the height of the forest. We show that for all distributions of the

Z_{n}

, the forest contains at most one infinite tree, almost surely. If

m a t h b b E Z_{n} < i n f t y

, then there is a unique infinite tree and the total size of the remaining trees is finite, with finite expected value if

m a t h b b E Z_{n}^{2} < i n f t y

. If

m a t h b b E Z_{n} = i n f t y

then almost surely all trees are finite.

This page was built for publication: Subtractive random forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506832)