Advertisement

Automation and Remote Control

, Volume 80, Issue 8, pp 1519–1540 | Cite as

Resource Allocation Among Attractor Vertices in Asymmetric Regular Resource Networks

  • L. Yu. ZhilyakovaEmail author
Large Scale Systems Control
  • 2 Downloads

Abstract

In this paper, asymmetric regular resource networks with several attractor vertices are considered. It is demonstrated that the resource surplus ΔW = WT 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.

Keywords

resource network graph dynamic threshold model attractor vertices 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgments

This work was supported in part by the Russian Foundation for Basic Research, projects nos. 14-01-00422a, 15-07-02488a.

References

  1. 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
  2. 2.
    Gantmakher, F.R., Teoriya matrits (Theory of Matrices), Moscow: Fizmatlit, 2004.zbMATHGoogle Scholar
  3. 3.
    Zhilyakova, L.Yu., Asymmetric Resource Networks. III. A Study of Limit States, Autom. Remote Control, 2012, vol. 73, no. 7, pp. 1165–1172.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Zhilyakova, L.Yu., Limit States Control in Absorbing Resource Networks, Probl. Upravlen., 2013, no. 3, pp. 51–59.Google Scholar
  5. 5.
    Kemeny, J. and Snell, J., Finite Markov Chains, Princeton: Van Nostrand, 1960. Translated under the title Konechnye tsepi Markova, Moscow: Nauka, 1970.zbMATHGoogle Scholar
  6. 6.
    Kuznetsov, O.P., Uniform Resource Networks. I. Complete Graphs, Autom. Remote Control, 2009, vol. 70, no. 11, pp. 1889–1900.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    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.zbMATHGoogle Scholar
  8. 8.
    Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Upper Saddle River: Prentice Hall, 1993.zbMATHGoogle Scholar
  9. 9.
    Bak, P., How Nature Works: The Science of Self-Organized Criticality, New York: Copernicus, 1996.CrossRefzbMATHGoogle Scholar
  10. 10.
    Bak, P., Tang, C., and Wiesenfeld, K., Self-Organized Criticality, Phys. Rev. A, 1988, vol. 38, no. 1, pp. 364–374.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Björner, A. and Lovasz, L., Chip-Firing Game on Directed Graphs, J. Algebr. Combinat., 1992, no. 1, pp. 305–328.Google Scholar
  12. 12.
    Blanchard, Ph. and Volchenkov, D., Random Walks and Diffusions on Graphs and Databases: An Introduction, Springer Series in Synergetics, Berlin: Springer-Verlag, 2011.CrossRefzbMATHGoogle Scholar
  13. 13.
    Dhar, D., Self-organized Critical State of Sandpile Automation Models, Phys. Rev. Lett., 1990, no. 64, pp. 1613–1616.Google Scholar
  14. 14.
    Ivashkevich, E.V. and Priezzhev, V.B., Introduction to the Sandpile Model, Physica A, 1998, vol. 254, pp. 97–116.CrossRefGoogle Scholar
  15. 15.
    Hajnal, J., The Ergodic Properties of Non-Homogeneous Finite Markov Chains, Proc. Cambridge Philos. Soc., 1956, vol. 52, pp. 67–77.MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Hajnal, J., Weak Ergodicity in Non-Homogeneous Markov Chains, Proc. Cambridge Philos. Soc., 1958, vol. 54, pp. 233–246.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 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. 18.
    Prisner, E., Parallel Chip Firing on Digraphs, Complex Syst., 1994, no. 8, pp. 367–383.Google Scholar
  19. 19.
    Seneta, E., Non-negative Matrices and Markov Chains, New York: Springer, 2006.zbMATHGoogle Scholar
  20. 20.
    Speer, E.R., Asymmetric Abelian Sandpile Models, J. Statist. Phys., 1993, vol. 71, no. 1–2, pp. 61–74.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2019

Authors and Affiliations

  1. 1.Trapeznikov Institute of Control SciencesRussian Academy of SciencesMoscowRussia

Personalised recommendations