Abstract
We generalize the clustering theorem by Lanchier (2012) on the infinite one-dimensional integer lattice ℤ for the constrained voter model and the two-feature two-trait Axelrod model to multitype biased models with confidence threshold. Types are represented by a connected graph Γ, and dynamics is described as follows. At independent exponential times for each site of type i, one of the neighboring sites is chosen randomly, and its type j is adopted if i, j are adjacent on Γ. Starting from a product measure with positive type densities, the clustering theorem dictates that fluctuation and clustering occurs, i.e., each site changes type at arbitrary large times and looking at a finite interval consensus is reached asymptotically with probability 1, if there is one or two vertices of Γ adjacent to all other vertices but each other. Additionally, we propose a simple definition of clustering on a finite set, in which case one can apply the clustering theorem that justifies known previous claims.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adamopoulos, A., Scarlatos, S.: Emulation and complementarity in one-dimensional alternatives of the Axelrod model with binary features. Complexity 17, 43–49 (2012)
Axelrod, R.: The dissemination of culture: A model with local convergence and global polarization. J. Conflict Res. 41, 203–226 (1997)
Castellano, C., Fortunato, S., Loreto, V.: Statistical physics of social dynamics. Rev. Modern Phys. 81, 591–646 (2009)
Clifford, P., Sudbury, A.: A model for spatial conflict. Biometrika 60, 581–588 (1973)
Fisch, R.: The one-dimensional cyclic cellular automaton: a system with deterministic dynamics that emulates an interacting particle system with stochastic dynamics. J. Theoretical Probab. 3, 311–338 (1990)
Harris, T.E.: Additive set-valued Markov processes and graphical methods. Ann. Probab. 6, 355–378 (1978)
Holley, R.A., Liggett, T.M.: Ergodic theorems for weakly interacting infinite systems and the voter model. Ann. Probab. 3, 643–663 (1975)
Itoh, Y., Mallows, C., Shepp, L.: Explicit sufficient invariants for an interacting particle system. J. Appl. Probab. 35, 633–641 (1998)
Lanchier, N.: Opinion dynamics with confidence threshold: an alternative to the Axelrod model. ALEA Lat. Am. J. Probab. Math. Stat. 7, 1–18 (2010)
Lanchier, N.: The Axelrod model for the dissemination of culture revisited. Ann. Appl. Probab. 22, 860–880 (2012)
Lanchier, N., Schweinsberg, J.: Consensus in the two-state Axelrod model. To appear in Stochastic Process. Appl.
Lanchier, N., Scarlatos, S.: Fixation in the one-dimensional Axelrod model (2012), http://math.la.asu.edu/~lanchier/articles/20xxb_lanchier_scarlatos.pdf (accessed August 7, 2012) (submitted)
Liggett, T.M.: Interacting Particle Systems. Springer, New York (1985)
Scarlatos, S.: Fixation in the Symmetric Cyclic System (with Paradoxical Effect in the Six-Color Automaton). In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 141–150. Springer, Heidelberg (2012)
Schwartz, D.: On hitting probabilities for an annihilating particle model. Ann. Probab. 6, 398–403 (2004)
Vázquez, F., Krapivsky, P.L., Redner, S.: Constrained opinion dynamics: freezing and slow evolution. J. Phys. A 68, L61–L68 (2003)
Vázquez, F., Redner, S.: Ultimate fate of constrained voters. J. Phys. A 37, 8479–8494 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adamopoulos, A., Scarlatos, S. (2012). Behavior of Social Dynamical Models II: Clustering for Some Multitype Particle Systems with Confidence Threshold. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)