Dynamic graph models and their properties
From MaRDI portal
Publication:276764
DOI10.1134/S000511791508007XzbMath1384.90018OpenAlexW2238762186MaRDI QIDQ276764
Publication date: 4 May 2016
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s000511791508007x
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Related Items
Experimental research on the welfare in a closed production network, 2-3 paths in a lattice graph: random walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymmetric resource networks. III: A study of limit states
- Asymmetric resource networks. II. Flows for large resources and their stabilization
- Bidirectional resource networks: A new flow model
- Random walks and diffusions on graphs and databases. An introduction.
- Informational influence and informational control models in social networks
- Chip-firing games on directed graphs
- Asymmetrical resource networks. I. Stabilization processes for low resources
- Chip-firing games on graphs
- Balancing vectors in the max norm
- The probabilistic abacus
- Why does the probabilistic abacus work?
- Chip-firing and the critical group of a graph
- Chip firing and the Tutte polynomial
- Laplacians and the Cheeger inequality for directed graphs
- The Tutte polynomial as a growth function
- A chip-firing game and Dirichlet eigenvalues
- The projection method for reaching consensus and the regularized power limit of a stochastic matrix
- Uniform resource networks. I: Complete graphs
- Emergence of Scaling in Random Networks
- Self-organized criticality
- Disks, Balls, and Walls: Analysis of a Combinatorial Game
- Course 14 Mathematical aspects of the Abelian Sandpile model
- Self-organized critical state of sandpile automaton models
- Algebraic aspects of Abelian sandpile models
- Approximate load balancing on dynamic and asynchronous networks
- Collective dynamics of ‘small-world’ networks
