This article is cited in 16 papers

System Analysis and Operations Research

Dynamic graph models and their properties

L. Yu. Zhilyakova

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

Abstract: The review of a number of non-classical flow models and threshold models of spreading activity in a network is given. The description of flow models with nonstandard reachability is provided. Integer-valued threshold models to which “chip-firing game” and “probabilistic abacus” belongs are described. The model of self-organized criticality and its graph interpretation is described. We show the basic properties of a real “real-valued network” threshold model, and perform comparative analysis of these kinds of models.

Presented by the member of Editorial Board: P. Yu. Chebotarev

Received: 05.06.2014

 English version: Automation and Remote Control, 2015, 76:8, 1417–1435

Bibliographic databases:

• 
• 
• 
•