RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

Prikl. Diskr. Mat. Suppl., 2013 Issue 6, Pages 75–76 (Mi pdma83)

Applied graph theory

Dynamical properties of some discrete automaton mappings defined by random graphs

A. A. Evdokimova, S. E. Kochemazovb, I. V. Otpushennikovb, A. A. Semenovb

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Institute of System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences, Irkutsk

Abstract: 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.

UDC: 519.7



© Steklov Math. Inst. of RAS, 2024