Multi-commodity allocation for dynamic demands using pagerank vectors

Authors:
Fan Chung;Paul Horn;Jacob Hughes
Affiliations:
University of California, San Diego;Harvard University;University of California, San Diego
Venue:
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Year:
2012

Citing 3
Cited 0

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Local partitioning for directed graphs using PageRank

WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
How to distribute antidote to control epidemics

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a variant of the contact process concerning multi-commodity allocation on networks. In this process, the demands for several types of commodities are initially given at some specified vertices and then the demands spread interactively on a 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.