Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
Gantmakher, F.R., Teoriya matrits (Theory of Matrices), Moscow: Fizmatlit, 2004.
Zhilyakova, L.Yu., Asymmetric Resource Networks. III. A Study of Limit States, Autom. Remote Control, 2012, vol. 73, no. 7, pp. 1165–1172.
Zhilyakova, L.Yu., Limit States Control in Absorbing Resource Networks, Probl. Upravlen., 2013, no. 3, pp. 51–59.
Kemeny, J. and Snell, J., Finite Markov Chains, Princeton: Van Nostrand, 1960. Translated under the title Konechnye tsepi Markova, Moscow: Nauka, 1970.
Kuznetsov, O.P., Uniform Resource Networks. I. Complete Graphs, Autom. Remote Control, 2009, vol. 70, no. 11, pp. 1889–1900.
Ford, L.R., Jr. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.
Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Upper Saddle River: Prentice Hall, 1993.
Bak, P., How Nature Works: The Science of Self-Organized Criticality, New York: Copernicus, 1996.
Bak, P., Tang, C., and Wiesenfeld, K., Self-Organized Criticality, Phys. Rev. A, 1988, vol. 38, no. 1, pp. 364–374.
Björner, A. and Lovasz, L., Chip-Firing Game on Directed Graphs, J. Algebr. Combinat., 1992, no. 1, pp. 305–328.
Blanchard, Ph. and Volchenkov, D., Random Walks and Diffusions on Graphs and Databases: An Introduction, Springer Series in Synergetics, Berlin: Springer-Verlag, 2011.
Dhar, D., Self-organized Critical State of Sandpile Automation Models, Phys. Rev. Lett., 1990, no. 64, pp. 1613–1616.
Ivashkevich, E.V. and Priezzhev, V.B., Introduction to the Sandpile Model, Physica A, 1998, vol. 254, pp. 97–116.
Hajnal, J., The Ergodic Properties of Non-Homogeneous Finite Markov Chains, Proc. Cambridge Philos. Soc., 1956, vol. 52, pp. 67–77.
Hajnal, J., Weak Ergodicity in Non-Homogeneous Markov Chains, Proc. Cambridge Philos. Soc., 1958, vol. 54, pp. 233–246.
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.
Prisner, E., Parallel Chip Firing on Digraphs, Complex Syst., 1994, no. 8, pp. 367–383.
Seneta, E., Non-negative Matrices and Markov Chains, New York: Springer, 2006.
Speer, E.R., Asymmetric Abelian Sandpile Models, J. Statist. Phys., 1993, vol. 71, no. 1–2, pp. 61–74.
Acknowledgments
This work was supported in part by the Russian Foundation for Basic Research, projects nos. 14-01-00422a, 15-07-02488a.
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © The Author(s), 2016, published in Upravlenie Bol’shimi Sistemami, 2016, No. 60, pp. 82–118.
Rights and permissions
About this article
Cite this article
Zhilyakova, L.Y. Resource Allocation Among Attractor Vertices in Asymmetric Regular Resource Networks. Autom Remote Control 80, 1519–1540 (2019). https://doi.org/10.1134/S0005117919080113
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117919080113