NER automata dynamics on random graphs

被引:0
|
作者
Hernandez, G. [1 ,2 ]
Salinas, L. [3 ]
机构
[1] Andres Bello Natl Univ, Sch Civil Engn, Santiago, Chile
[2] Univ Chile, Ctr Math Modeling, Santiago, Chile
[3] Univ Fed Santa Maria, Dept Informat, Valparaiso, Chile
关键词
NER automata; transient time; damage spreading; random graphs;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The average transient time, damage spreading and qualitative effects are deter-mined for the NER automata parallel dynamics defined on random graphs. It was obtained that the NER automata converge with linear rate to fixed points, the average damage spreading presents a linear response without discontinuity at the origin for small damage limit and the hamming distance between the initial and steady configurations falls in the range [0.82,0.88]. These results can be interpreted as a generalization of ref. [8] to the case of random graphs where the global connectivity is present.
引用
收藏
页码:203 / +
页数:2
相关论文
共 50 条
  • [41] Random Deterministic Automata
    Nicaud, Cyril
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 5 - 23
  • [42] A CLASS OF RANDOM AUTOMATA
    SRAGOVIC.VG
    FLEROV, YA
    ENGINEERING CYBERNETICS, 1965, (02): : 61 - &
  • [43] RANDOM ENVIRONMENTS AND AUTOMATA
    TAKEUCHI, A
    KITAHASHI, T
    TANAKA, K
    INFORMATION SCIENCES, 1975, 8 (02) : 141 - 154
  • [44] Graphs and Automata Extended abstract
    Melichar, Borivoj
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2013, 2013, : 1 - 6
  • [45] GRAPHS OF LOGICAL AUTOMATA AND THEIR TRANSFORMATIONS
    KUZNETSOV, OP
    AUTOMATION AND REMOTE CONTROL, 1975, 36 (09) : 1517 - 1525
  • [46] RANDOM IMPUT AUTOMATA
    BOOTH, TL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (04) : 394 - &
  • [47] Weighted Automata and Logics on Graphs
    Droste, Manfred
    Dueck, Stefan
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 192 - 204
  • [48] The Labeling Graphs of Definite Automata
    Ishchenko, R. A.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2019, 74 (05) : 198 - 201
  • [49] DECOMPOSITION OF GRAPHS AND FINITE AUTOMATA
    MELIKOV, AN
    BERSHTEY.LS
    KARELIN, VP
    ENGINEERING CYBERNETICS, 1968, (02): : 110 - &
  • [50] On path hypercompositions in graphs and automata
    Massouros, Christos G.
    1ST MINI CONFERENCE ON EMERGING ENGINEERING APPLICATIONS (MCEEA'15), 2016, 41