Multicommodity Allocation for Dynamic Demands Using PageRank Vectors

Abstract We consider a variant of the contact process concerning multicommodity allocation. In this process, the demands for several types of commodities are initially given at some specified vertices, and then the demands spread interactively in the contact graph. To allocate supplies in such a dynamic setting, we use a modified version of PageRank vectors, called Kronecker PageRank, to identify vertices for shipping supplies. We analyze both the situation that the demand distribution evolves mostly in clusters around the initial vertices and the case that the demands spread to the whole network. We establish sharp upper bounds for the probability that the demands are satisfied as a function of PageRank vectors.