CELLULAR AUTOMATA MODEL OF CARDIAC PACEMAKER
Danuta Makowiec · Acta Physica Polonica B · 2008
A network of Greenberg–Hasting cellular automata with cyclic intrinsic dynamics F → R → A → F → . . . is shown to be a reliable approximation to the cardiac pacemaker. The three possible cell’s states F , R, A are characterized by fixed timings {nF , nR, nA} — time steps spent in each state. Dynamical properties of a simple line network are found to be critical with respect to the relation between nF and nR. The properties of a network arisen from a square lattice where some edges are rewired (locally and with the preference to link to cells which are more connected to other cells) are also studied. The resulted system evolves rhythmically with the period determined by timings. The emergence of a small group of neighboring automata where the whole system activity initiates is observed. The dominant evolution is accompanied with other rhythms, characterized by longer periods.