Graph-based Pólya’s urn: Completion of the linear case
Graph-based Pólya’s urn: Completion of the linear case
Given a finite connected graph [Formula: see text], place a bin at each vertex. Two bins are called a pair if they share an edge of [Formula: see text]. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins …