Percolation and best-choice problem for powers of paths

• DOI: 10.1017/jpr.2017.4
• Publication Date: 2017-06-22T10:42:28Z
• Authors: Fabricio Siqueira...; Małgorzata Sulkowska
• Keywords: 2. Zero hunger; 0102 computer and information sciences; 01 natural sciences

AbstractThe vertices of thekth power of a directed path withnvertices are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices that have already appeared. The selector's aim is to choose online the maximal vertex (i.e. the vertex with no outgoing edges). We give upper and lower bounds for the asymptotic behaviour ofpn,kn1/(k+1), wherepn,kis the probability of success under the optimal algorithm. In order to derive the upper bound, we consider a model in which the selector obtains some extra information about the edges that have already appeared. We give the exact asymptotics of the probability of success under the optimal algorithm in this case. In order to derive the lower bound, we analyse a site percolation process on a sequence of thekth powers of a directed path withnvertices.