Geodesic
Dynamical properties of some discrete automaton mappings defined by random graphs
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 75-76.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this report, the results of computational analysis are presented for problems of searching fixed points and cycles of some discrete mappings, that are used to model the behaviour of systems with many interconnecting agents and are defined by random graphs generated according to known models ($G_{np}$-graphs, the Watts– Strogatz model).
Keywords: random graphs, gene networks, discrete automaton mappings, SAT. 
@article{PDMA_2013_6_a34,
     author = {A. A. Evdokimov and S. E. Kochemazov and I. V. Otpushennikov and A. A. Semenov},
     title = {Dynamical properties of some discrete automaton mappings defined by random graphs},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {75--76},
     publisher = {mathdoc},
     number = {6},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a34/}
}
TY  - JOUR
AU  - A. A. Evdokimov
AU  - S. E. Kochemazov
AU  - I. V. Otpushennikov
AU  - A. A. Semenov
TI  - Dynamical properties of some discrete automaton mappings defined by random graphs
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 75
EP  - 76
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a34/
LA  - ru
ID  - PDMA_2013_6_a34
ER  - 
%0 Journal Article
%A A. A. Evdokimov
%A S. E. Kochemazov
%A I. V. Otpushennikov
%A A. A. Semenov
%T Dynamical properties of some discrete automaton mappings defined by random graphs
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 75-76
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a34/
%G ru
%F PDMA_2013_6_a34
A. A. Evdokimov; S. E. Kochemazov; I. V. Otpushennikov; A. A. Semenov. Dynamical properties of some discrete automaton mappings defined by random graphs. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 75-76. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a34/

[1] Newman M. E. J., “The structure and function of complex networks”, SIAM Review, 45 (2003), 167–256 | DOI | MR | Zbl

[2] Dorogovtsev S. N., Goltsev A. V., Mendes J. F. F., “Critical phenomena in complex networks”, Rev. Mod. Phys., 80 (2008), 1275–1335 | DOI

[3] N. A. Kolchanov, V. A. Goncharov, V. A. Likhoshvai, V. A. Ivanisenko (red.), Sistemnaya kompyuternaya biologiya, Izd-vo SO RAN, Novosibirsk, 2008

[4] Vitali S., Glattfelder J., Battiston S., “The network of global corporate control”, PLoS ONE, 6:10, e25995, doi:10.1371/journal.pone.002 | DOI

[5] Grigorenko E. D., Evdokimov A. A., Likhoshvai V. A., Lobareva I. A., “Nepodvizhnye tochki i tsikly avtomatnykh otobrazhenii, modeliruyuschikh funktsionirovanie gennykh setei”, Vestnik Tomskogo gosudarstvennogo universiteta. Prilozhenie, 2005, no. 14, 206–212

[6] Evdokimov A. A., Kochemazov S. E., Semenov A. A., “Primenenie simvolnykh vychislenii k issledovaniyu diskretnykh modelei nekotorykh klassov gennykh setei”, Vychislitelnye tekhnologii, 16:1 (2011), 30–47

[7] Biere A., Heule V., van Maaren H., Walsh T., Handbook of Satisfiability, IOS Press, 2009 | Zbl

[8] Evdokimov A. A., Kochemazov S. E., Otpuschennikov I. V., Semenov A. A., “Simvolnye algoritmy resheniya bulevykh uravnenii v primenenii k issledovaniyu diskretnykh modelei gennykh setei”, Problemy teoreticheskoi kibernetiki, Materialy XVI Mezhdunar. konf. (N. Novgorod, 2011), 151–154