Single-Threshold Model Resource Network and Its Double-Threshold Modifications
Open Access
- 21 June 2021
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 9 (12) , 1444
Abstract
A resource network is a non-classical flow model where the infinitely divisible resource is iteratively distributed among the vertices of a weighted digraph. The model operates in discrete time. The weights of the edges denote their throughputs. The basic model, a standard resource network, has one general characteristic of resource amount—the network threshold value. This value depends on graph topology and weights of edges. This paper briefly outlines the main characteristics of standard resource networks and describes two its modifications. In both non-standard models, the changes concern the rules of receiving the resource by the vertices. The first modification imposes restrictions on the selected vertices’ capacity, preventing them from accumulating resource surpluses. In the second modification, a network with so-called greedy vertices, on the contrary, vertices first accumulate resource themselves and only then begin to give it away. It is noteworthy that completely different changes lead, in general, to the same consequences: the appearance of a second threshold value. At some intervals of resource values in networks, their functioning is described by a homogeneous Markov chain, at others by more complex rules. Transient processes and limit states in networks with different topologies and different operation rules are investigated and described.Keywords
Funding Information
- Russian Foundation for Basic Research (20-07-00190, 19-07-00525)
This publication has 25 references indexed in Scilit:
- A study of Euler resource networksAutomation and Remote Control, 2014
- Asymmetric resource networks. III. A study of limit statesAutomation and Remote Control, 2012
- Asymmetric resource networks. II. Flows for large resources and their stabilizationAutomation and Remote Control, 2012
- Asymmetrical resource networks. I. Stabilization processes for low resourcesAutomation and Remote Control, 2011
- Uniform resource networks I. Complete graphsAutomation and Remote Control, 2009
- The Abelian sandpile and related modelsPhysica A: Statistical Mechanics and its Applications, 1999
- Chip-firing Games on GraphsEuropean Journal of Combinatorics, 1991
- Self-organized critical state of sandpile automaton modelsPhysical Review Letters, 1990
- Self-organized criticalityPhysical Review A, 1988
- Weak ergodicity in non-homogeneous Markov chainsMathematical Proceedings of the Cambridge Philosophical Society, 1958