NER Automata Dynamics on Random Graphs
Author
Abstract
The average transient time, damage spreading and qualitative effects are determined 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.
Patrocinador
Supported by grants: Fondecyt 1050808 and 1040366 and UTFSM DGIP 24.04.21.
Identifier
URI: https://repositorio.uchile.cl/handle/2250/125317
Quote Item
Lecture Series on Computer and Computational Sciences Volume 6, 2006, pp. 1-3
Collections