L. Yu. Zhilyakova, “Dynamic graph models and their properties”, Avtomat. i Telemekh., 2015, no. 8, 115–139; Autom. Remote Control, 76:8 (2015), 1417

Avtomatika i Telemekhanika

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor
	Guidelines for authors
	Submit a manuscript

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Avtomatika i Telemekhanika, 2015, Issue 8, Pages 115–139 (Mi at14269)

This article is cited in 15 scientific papers (total in 15 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

Full-text PDF (312 kB) Citations (15)

References:

PDF

HTML

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, Volume 76, Issue 8, Pages 1417–1435
DOI: https://doi.org/10.1134/S000511791508007X

Bibliographic databases:

Document Type: Article

Language: Russian

Citation: L. Yu. Zhilyakova, “Dynamic graph models and their properties”, Avtomat. i Telemekh., 2015, no. 8, 115–139; Autom. Remote Control, 76:8 (2015), 1417–1435

Citation in format AMSBIB

\Bibitem{Zhi15}

\by L.~Yu.~Zhilyakova

\paper Dynamic graph models and their properties

\jour Avtomat. i Telemekh.

\yr 2015

\issue 8

\pages 115--139

\mathnet{http://mi.mathnet.ru/at14269}

\elib{https://elibrary.ru/item.asp?id=24353096}

\transl

\jour Autom. Remote Control

\yr 2015

\vol 76

\issue 8

\pages 1417--1435

\crossref{https://doi.org/10.1134/S000511791508007X}

\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000359639100007}

\elib{https://elibrary.ru/item.asp?id=24005260}

\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84939124017}

Linking options:

https://www.mathnet.ru/eng/at14269

https://www.mathnet.ru/eng/at/y2015/i8/p115

This publication is cited in the following 15 articles:

Haidar N. Abdulrahman, Iakov M. Erusalimskiy, “ON THE REALIZABILITY OF STATIONARY FLOWS IN RESOURCE NETWORKS BY FLOWS IN CLASSICAL NETWORKS”, J Math Sci, 2024
Ya. M. Erusalimskii, Kh. N. Abdulrakhman, V. A. Skorokhodov, V. A. Babintsev, “O funktsionirovanii resursnykh setei”, Materialy Voronezhskoi mezhdunarodnoi vesennei matematicheskoi shkoly «Sovremennye metody kraevykh zadach. Pontryaginskie chteniya—XXXV», Voronezh, 26-30 aprelya 2024 g. Chast 2, Itogi nauki i tekhn. Sovrem. mat. i ee pril. Temat. obz., 236, VINITI RAN, M., 2024, 13–21
Iakov Erusalimskiy, Vladislav Rusakov, 2023 Applied Mathematics, Computational Science and Mechanics: Current Problems (AMCSM), 2023, 1
Ya. M. Erusalimskii, M. I. Cherdyntseva, “Kombinatornyi algoritm nakhozhdeniya kolichestva putei na orientirovannom grafe”, Materialy Voronezhskoi vesennei matematicheskoi shkoly «Sovremennye metody teorii kraevykh zadach. Pontryaginskie chteniya–XXXI». Voronezh, 3–9 maya 2020 g., Itogi nauki i tekhn. Sovrem. mat. i ee pril. Temat. obz., 204, VINITI RAN, M., 2022, 37–43
Ya. M. Erusalimskii, A. V. Ivantsov, “« ${n}$ - $1$ » puti na grafe–reshetke. Sluchainye bluzhdaniya”, Materialy Voronezhskoi vesennei matematicheskoi shkoly «Sovremennye metody teorii kraevykh zadach. Pontryaginskie chteniya–XXX». Voronezh, 3–9 maya 2019 g. Chast 5, Itogi nauki i tekhn. Sovrem. mat. i ee pril. Temat. obz., 194, VINITI RAN, M., 2021, 107–114
Zhilyakova L., “Single-Threshold Model Resource Network and Its Double-Threshold Modifications”, Mathematics, 9:12 (2021), 1444
Anam Iqbal, Farheen Siddiqui, Advances in Intelligent Systems and Computing, 1166, International Conference on Innovative Computing and Communications, 2021, 463
I M Erusalimskiy, V A Skorokhodov, “On flows in networks with reachability restrictions”, J. Phys.: Conf. Ser., 1902:1 (2021), 012063
I. M. Erusalimskiy, K. L. Pevneva, “Graphs with table constraints on reachability”, Applied Mathematics, Computational Science and Mechanics: Current Problems, Journal of Physics Conference Series, 1479, IOP Publishing Ltd, 2020, 012028
L. Zeng, W. Ren, Yu. Chen, M. Lei, “Lmdgw: a novel matrix based dynamic graph watermark”, J. Ambient Intell. Humaniz. Comput., 10:1, SI (2019), 295–304
IM Erusalimskiy, “S - r ways on a graph-lattice”, J. Phys.: Conf. Ser., 1203 (2019), 012040
I. M. Erusalimskyi, “2–3 Paths in a Lattice Graph: Random Walks”, Math. Notes, 104:3 (2018), 395–403
L. Yu. Zhilyakova, “Resource network with limitations on vertex capacities: a double-threshold dynamic flow model”, Artificial Intelligence, RCAI 2018, Communications in Computer and Information Science, 934, eds. S. Kuznetsov, G. Osipov, V. Stefanuk, Springer-Verlag, Berlin, 2018, 240–248
E. E. Ivanko, “Eksperimentalnoe issledovanie dinamiki denezhnogo sostoyaniya uchastnikov zamknutoi proizvodstvennoi seti”, Izv. IMI UdGU, 52 (2018), 33–46
O. P. Kuznetsov, “Complex networks and activity spreading”, Autom. Remote Control, 76:12 (2015), 2091–2109

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	632
Full-text PDF :	224
References:	95
First page:	46

Registration to the website

Logotypes