论文信息 - Stable States of Probabilisti Cellular Automata

Stable States of Probabilisti Cellular Automata

A study is made of the stability of steady states of probabilistic cellular automata defined on countable graphs. An important class of states are the quasi-deterministic states in which the “error sets” are confined to small isolated sets in the graph. In particular, quasi-deterministic states of majority vote systems defined on trees are discussed and criteria for their existence and stability are obtained.

D. A. Dawson | D. Dawson

[1] John von Neumann,et al. Theory Of Self Reproducing Automata , 1967 .

[2] S. Winograd,et al. Reliable Computation in the Presence of Noise , 1963 .

[3] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[4] J. W. Essam,et al. Some Cluster Size and Percolation Problems , 1961 .

[5] Claude E. Shannon,et al. Reliable Circuits Using Less Reliable Relays , 1956 .

[6] Arthur W. Burks,et al. Essays on cellular automata , 1970 .

[7] R. Dobrushin. The problem of uniqueness of a gibbsian random field and the problem of phase transitions , 1968 .

[8] D. A. Dawson,et al. Information flow in discrete Markov systems , 1973, Journal of Applied Probability.