PARALLEL CHIP FIRING GAMES ON GRAPHS

被引：33

作者：

BITAR, J

GOLES, E

机构：

[1] Departamento de Ingeniería Matemática, Escuela de Ingeniería, Universidad de Chile, Correo 3 Santiago

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 92卷 / 02期

关键词：

D O I：

10.1016/0304-3975(92)90316-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the periodic behaviour of parallel dynamics associated with the chip firing game introduced by Spencer (1986). We prove that on trees the periods are of length one (fixed points) or two. For general graphs we give counter-examples where periods depend on the graph size. We also prove that the chip firing game may be used as an algorithm to evaluate logical functions, which shows that the dynamics have nontrivial computing capabilities. Finally, we study a related game on graphs.

引用

页码：291 / 300

页数：10

共 9 条

[1] DISKS, BALLS, AND WALLS - ANALYSIS OF A COMBINATORIAL GAME [J].

ANDERSON, R ;

LOVASZ, L ;

SHOR, P ;

SPENCER, J ;

TARDOS, E ;

WINOGRAD, S .

AMERICAN MATHEMATICAL MONTHLY, 1989, 96 (06) :481-493

[2]

BITAR J, 1989, THESIS U CHILE

[3]

BJONER A, 1988, CHIP FIRING GAMES GR

[4]

GOLES E, 1988, COMPLEX SYSTEMS, V2

[5]

GOLES E, 1990, AUTOMATA NEURAL NETW

[6]

Odlyzko A. M., 1987, Complex Systems, V1, P203

[7] BALANCING VECTORS IN THE MAX NORM [J].

SPENCER, J .

COMBINATORICA, 1986, 6 (01) :55-65

[8]

Tardos G., 1988, SIAM J DISCRETE MATH, V1, P397, DOI DOI 10.1137/0401039

[9]

WOLFRAM S, 1986, THEORY APPLICATIONS

← 1 →