Resource Allocation Among Attractor Vertices in Asymmetric Regular Resource Networks
- 2 Downloads
In this paper, asymmetric regular resource networks with several attractor vertices are considered. It is demonstrated that the resource surplus ΔW = W − T above a threshold value W = T has the same allocation in such a network as in the corresponding absorbing network, which is obtained from the asymmetric one by eliminating the outbound edges of attractors. But there exist corrections depending on the capacities of the outbound edges of attractors and also on the initial resource allocation. Upper bounds of these corrections are derived. The initial states that lead to the exact limit states without any adjustments are determined.
Keywordsresource network graph dynamic threshold model attractor vertices
Unable to display preview. Download preview PDF.
This work was supported in part by the Russian Foundation for Basic Research, projects nos. 14-01-00422a, 15-07-02488a.
- 1.Agaev, R.P. and Chebotarev, P.Yu., Convergence and Stability in Parameter Consensus Problems (A Survey of Basic Results), Upravlen. Bol’sh. Sist., 2010, no. 30.1, pp. 470–505.Google Scholar
- 4.Zhilyakova, L.Yu., Limit States Control in Absorbing Resource Networks, Probl. Upravlen., 2013, no. 3, pp. 51–59.Google Scholar
- 11.Björner, A. and Lovasz, L., Chip-Firing Game on Directed Graphs, J. Algebr. Combinat., 1992, no. 1, pp. 305–328.Google Scholar
- 13.Dhar, D., Self-organized Critical State of Sandpile Automation Models, Phys. Rev. Lett., 1990, no. 64, pp. 1613–1616.Google Scholar
- 17.Lovasz, L. and Winkler, P., Mixing of Random Walks and Other Diffusions on a Graph, in Surveys in Combinatorics, Rowlinson, P., Ed., London Math. Soc., Lecture Notes Series 218, Cambridge Univ. Press, 1995, pp. 119–154.Google Scholar
- 18.Prisner, E., Parallel Chip Firing on Digraphs, Complex Syst., 1994, no. 8, pp. 367–383.Google Scholar