The heart pacemaker by cellular automata on complex networks

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Specially desinged network of Greenberg-Hastings (GH) cellular automata is shown to be a reliable approximation to cardiac pacemaker. A complex network is built basing on a square lattice where some edges are rewired locally and with preference to link to cells which are more connected to other cells. GH automata are systems with cyclic intrinsic dynamics where three possible cell's states are characterized by timings - time steps spent in each state. Complex networks of GH automata evolve rhythmically with periods determined by timings. Diversity of oscillations coexisting in the system depends on network topology. Large variety in oscillations is interpreted as effectiveness to response to actual needs of a body. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Makowiec, D. (2008). The heart pacemaker by cellular automata on complex networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5191 LNCS, pp. 291–298). https://doi.org/10.1007/978-3-540-79992-4_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free