TY - GEN

T1 - Cyclic automata networks on finite graphs

AU - Matamala, Martín

AU - Goles, Eric

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.

PY - 1995

Y1 - 1995

N2 - We study the principal dynamical aspects of the cyclic automata on finite graphs. We give bounds in the transient time and periodicity depending essentially on the graph structure. It is important to point out that there exist non-polynomial periods eΩ(√ |V| ), where V denotes the number of sites in the graph. To obtain these results we introduce some mathematical tool as continuity, firing paths, jump and efficiency, which are interesting by themselves because they give a strong mathematical framework to study such discrete dynamical systems.

AB - We study the principal dynamical aspects of the cyclic automata on finite graphs. We give bounds in the transient time and periodicity depending essentially on the graph structure. It is important to point out that there exist non-polynomial periods eΩ(√ |V| ), where V denotes the number of sites in the graph. To obtain these results we introduce some mathematical tool as continuity, firing paths, jump and efficiency, which are interesting by themselves because they give a strong mathematical framework to study such discrete dynamical systems.

UR - http://www.scopus.com/inward/record.url?scp=84955618903&partnerID=8YFLogxK

U2 - 10.1007/3-540-59175-3_105

DO - 10.1007/3-540-59175-3_105

M3 - Conference contribution

AN - SCOPUS:84955618903

SN - 9783540591757

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 398

EP - 410

BT - LATIN 1995

A2 - Baeza-Yates, Ricardo

A2 - Poblete, Patricio V.

A2 - Goles, Eric

PB - Springer Verlag

Y2 - 3 April 1995 through 7 April 1995

ER -