The Annals of Applied Probability

Limiting behavior of 3-color excitable media on arbitrary graphs

Janko Gravner, Hanbaek Lyu, and David Sivakoff

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Fix a simple graph $G=(V,E)$ and choose a random initial 3-coloring of vertices drawn from a uniform product measure. The 3-color cycle cellular automaton is a process in which at each discrete time step in parallel, every vertex with color $i$ advances to the successor color $(i+1)\bmod 3$ if in contact with a neighbor with the successor color, and otherwise retains the same color. In the Greenberg–Hastings model, the same update rule applies only to color 0, while other two colors automatically advance. The limiting behavior of these processes has been studied mainly on the integer lattices. In this paper, we introduce a monotone comparison process defined on the universal covering space of the underlying graph, and characterize the limiting behavior of these processes on arbitrary connected graphs. In particular, we establish a phase transition on the Erdős–Rényi random graph. On infinite trees, we connect the rate of color change to the cloud speed of an associated tree-indexed walk. We give estimates of the cloud speed by generalizing known results to trees with leaves.

Article information

Source
Ann. Appl. Probab., Volume 28, Number 6 (2018), 3324-3357.

Dates
Received: December 2016
Revised: June 2017
First available in Project Euclid: 8 October 2018

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1538985624

Digital Object Identifier
doi:10.1214/17-AAP1350

Mathematical Reviews number (MathSciNet)
MR3861815

Zentralblatt MATH identifier
06994395

Subjects
Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43] 82B43: Percolation [See also 60K35]

Keywords
Excitable media cellular automaton tournament expansion tree-indexed random walk

Citation

Gravner, Janko; Lyu, Hanbaek; Sivakoff, David. Limiting behavior of 3-color excitable media on arbitrary graphs. Ann. Appl. Probab. 28 (2018), no. 6, 3324--3357. doi:10.1214/17-AAP1350. https://projecteuclid.org/euclid.aoap/1538985624


Export citation

References

  • [1] Arnol’d, V. I. (2013). Mathematical Methods of Classical Mechanics. Graduate Texts in Mathematics 60. Springer, New York.
  • [2] Belitsky, V. and Ferrari, P. A. (1995). Ballistic annihilation and deterministic surface growth. J. Stat. Phys. 80 517–543.
    Zentralblatt MATH: 1081.60553
    Digital Object Identifier: doi:10.1007/BF02178546
  • [3] Benjamini, I. and Peres, Y. (1994). Tree-indexed random walks on groups and first passage percolation. Probab. Theory Related Fields 98 91–112.
    Zentralblatt MATH: 0794.60068
    Digital Object Identifier: doi:10.1007/BF01311350
  • [4] Bollobás, B. (1998). Random graphs. In Modern Graph Theory 215–252. Springer, Berlin.
  • [5] Bramson, M. and Griffeath, D. (1989). Flux and fixation in cyclic particle systems. Ann. Probab. 17 26–45.
    Zentralblatt MATH: 0673.60103
    Digital Object Identifier: doi:10.1214/aop/1176991492
    Project Euclid: euclid.aop/1176991492
  • [6] Datta, A. K., Petit, F. and Guerraoui, R. (2016). Toward a time-optimal odd phase clock unison in trees. In Stabilization, Safety, and Security of Distributed Systems 137–151. Springer, Cham.
  • [7] Dembo, A. and Zeitouni, O. (2009). Large Deviations Techniques and Applications. Applications of Mathematics (New York) 38. Springer, New York.
    Zentralblatt MATH: 0793.60030
  • [8] Deuschel, J.-D. and Stroock, D. W. (1989). Large Deviations. Pure and Applied Mathematics 137. Academic Press, Boston, MA.
    Zentralblatt MATH: 0705.60029
  • [9] Dolev, S. (2000). Self-Stabilization. MIT Press, Cambridge, MA.
    Zentralblatt MATH: 1026.93001
  • [10] Durrett, R. and Steif, J. E. (1991). Some rigorous results for the Greenberg-Hastings model. J. Theoret. Probab. 4 669–690.
    Zentralblatt MATH: 0741.92001
    Digital Object Identifier: doi:10.1007/BF01259549
  • [11] Fisch, R. (1990). The one-dimensional cyclic cellular automaton: A system with deterministic dynamics that emulates an interacting particle system with stochastic dynamics. J. Theoret. Probab. 3 311–338.
    Zentralblatt MATH: 0701.60105
    Digital Object Identifier: doi:10.1007/BF01045164
  • [12] Fisch, R. (1992). Clustering in the one-dimensional three-color cyclic cellular automaton. Ann. Probab. 20 1528–1548.
    Zentralblatt MATH: 0806.60096
    Digital Object Identifier: doi:10.1214/aop/1176989705
    Project Euclid: euclid.aop/1176989705
  • [13] Fisch, R. and Gravner, J. (1995). One-dimensional deterministic Greenberg-Hastings models. Complex Systems 9 329–348.
    Zentralblatt MATH: 0867.68120
  • [14] Fisch, R., Gravner, J. and Griffeath, D. (1991). Cyclic cellular automata in two dimensions. In Spatial Stochastic Processes. Progress in Probability 19 171–185. Birkhäuser, Boston, MA.
    Zentralblatt MATH: 0737.60088
  • [15] Fisch, R., Gravner, J. and Griffeath, D. (1991). Threshold-range scaling of excitable cellular automata. Stat. Comput. 1 23–39.
    Zentralblatt MATH: 0737.60088
  • [16] Greenberg, J. M. and Hastings, S. P. (1978). Spatial patterns for discrete models of diffusion in excitable media. SIAM J. Appl. Math. 34 515–523.
    Mathematical Reviews (MathSciNet): MR0484504
    Zentralblatt MATH: 0398.92004
    Digital Object Identifier: doi:10.1137/0134040
  • [17] Herman, T. and Ghosh, S. (1995). Stabilizing phase-clocks. Inform. Process. Lett. 54 259–265.
    Zentralblatt MATH: 0875.68040
    Digital Object Identifier: doi:10.1016/0020-0190(95)00050-M
  • [18] Janson, S., Łuczak, T. and Rucinski, A. (2011). Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization 45. Wiley-Interscience, New York.
  • [19] Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21 558–565.
    Zentralblatt MATH: 0378.68027
    Digital Object Identifier: doi:10.1145/359545.359563
  • [20] Lyons, R. (1989). The Ising model and percolation on trees and tree-like graphs. Comm. Math. Phys. 125 337–353.
    Zentralblatt MATH: 0679.60101
    Digital Object Identifier: doi:10.1007/BF01217911
    Project Euclid: euclid.cmp/1104179469
  • [21] Lyons, R. (1990). Random walks and percolation on trees. Ann. Probab. 18 931–958.
    Mathematical Reviews (MathSciNet): MR1062053
    Zentralblatt MATH: 0714.60089
    Digital Object Identifier: doi:10.1214/aop/1176990730
    Project Euclid: euclid.aop/1176990730
  • [22] Lyu, H. (2015). Synchronization of finite-state pulse-coupled oscillators. Phys. D 303 28–38.
    Zentralblatt MATH: 1364.37037
    Digital Object Identifier: doi:10.1016/j.physd.2015.03.007
  • [23] O’Connell, N. (1998). Some large deviation results for sparse random graphs. Probab. Theory Related Fields 110 277–285.
  • [24] Pittel, B. (1988). A random graph with a subcritical number of edges. Trans. Amer. Math. Soc. 309 51–75.
    Zentralblatt MATH: 0658.05062
    Digital Object Identifier: doi:10.1090/S0002-9947-1988-0957061-X
  • [25] Spencer, J. (1993). Nine lectures on random graphs. In École D’Été de Probabilités de Saint-Flour XXI—1991. Lecture Notes in Math. 1541 293–347. Springer, Berlin.
  • [26] Varadhan, S. R. S. (2008). Large deviations. Ann. Probab. 36 397–419.
    Mathematical Reviews (MathSciNet): MR2393987
    Zentralblatt MATH: 1146.60003
    Digital Object Identifier: doi:10.1214/07-AOP348
    Project Euclid: euclid.aop/1204306957
  • [27] Wiener, N. and Rosenblueth, A. (1946). The mathematical formulation of the problem of conduction of impulses in a network of connected excitable elements, specifically in cardiac muscle. Arch. Inst. Cardiol. Méx. 16 205–265.
    Zentralblatt MATH: 0134.37904

The Institute of Mathematical Statistics

The Annals of Applied Probability

New content alerts

Email RSS ToC RSS Article
  • You have access to this content.
  • You have partial access to this content.
  • You do not have access to this content.
Turn Off MathJax

What is MathJax?

More like this

+ See more