Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Chip-Firing Games on Directed Graphs
Journal of Algebraic Combinatorics: An International Journal
Mixing of random walks and other diffusions on a graph
Surveys in combinatorics, 1995
On Determining the Eigenprojection and Components of a Matrix
Automation and Remote Control
Convex Optimization
Uniform resource networks I. Complete graphs
Automation and Remote Control
Asymmetrical resource networks. I. Stabilization processes for low resources
Automation and Remote Control
Random Walks and Diffusions on Graphs and Databases: An Introduction
Random Walks and Diffusions on Graphs and Databases: An Introduction
Asymmetric resource networks. II. Flows for large resources and their stabilization
Automation and Remote Control
| Hi-index | 0.00 |
This paper studies the properties of resource networks with sink vertices called absorbing resource networks. In the presence of at least two sinks, the resource distribution in the limit state depends on the initial state of the network. We formulate two control problems in such networks. Sinks are treated as goal vertices. Control vertices represent some subset of vertices in the transition component.