Stable and Uniform Resource Allocation Strategies for Network Processes Using Vertex Energy Gradients
In this paper we investigate the effects of initial resource allocation strategy on the stability and uniformity of resource distribution in network-driven processes. We assume that the resource exchange process is controlled by the topology of the underlying network and we are looking for the initial allocation strategy which produces low variance and uniformity of resource distribution.
The results of experiments conducted on synthetic and empirical networks are surprising. We find that allocation strategies based on vertex energy outperform other strategies substantially for a wide spectrum of considered network topologies. In particular, we introduce for the first time the notion of vertex energy gradients and we use these gradients to compute eigenvalue centralities of vertices. Allocation of resources proportional to these centralities results in very stable and uniform distributions for resource exchange processes.
KeywordsResource allocation Vertex energy Network process
This work was supported by the National Science Centre, Poland, the decision no. 2016/23/B/ST6/03962.
- 2.Bollobás, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 132–139. Society for Industrial and Applied Mathematics (2003)Google Scholar
- 6.Gutman, I.: The energy of a graph: old and new results. In: Algebraic Combinatorics and Applications, pp. 196–211. Springer (2001)Google Scholar
- 13.Morduch, J., Haley, B.: Analysis of the effects of microfinance on poverty reduction. NYU Wagner Working Paper 1014, New York (2002)Google Scholar