Abstract
Given a population with internal structures determining possible interactions between population members, what can be said about the spread of innovation? In genetics, this is a question of the spread of a favorable mutation within a genetically homogeneous population. In a model society, it is the question of rumors, beliefs, or innovation [1,2,3,4,5]. This paper sketches a simple iterative model of populations with structure represented in terms of edge weighted graphs. Use of such graphs has become a powerful tool in evolutionary dynamics [e.g. 6]. The model presented here employs a Markov process on a state space isomorphic to the vertex set of the N-hypercube. In analogy to genetics, spread of innovation is first modeled as a biased birth-death process in which the innovation provides a fitness r as compared to the fitness of 1 assigned to non-innovative individuals. Following on this, a probabilistic model is developed that, in the simplest cases, corresponds to an elementary probabilistic cellular automata.
Keywords
- Fixation Probability
- State Transition Matrix
- Algebraic Connectivity
- Weighted Directed Graph
- NATO Advance Study Institute
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barbour, A.D., Reinert, G.: Asymptotic behavior of gossip processes and small world networks. arXiv: 1202.5895v2 (2012)
Shah, D., Zaman, T.R.: Rumors in a network: Who’s the culprit? IEEE Transactions on Information Theory 57, 5163–5181 (2011)
Tanimura, E.: Diffusion of innovations on community based Small Worlds: the role of correlation between social spheres. FEEM working paper 126 (2010), working.papers@feem.it
Wang, Y., Xiao, G., Liu, J.: Dynamics of competing ideas in complex social networks. arXiv: 1112.5534v1 (2011)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of KDD 2003, Washington DC (2003)
Nowak, M.A.: Evolutionary Dynamics. Cambridge. Harvard University Press, Cambridge (2006)
Moran, P.: Random processes in genetics. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 54(01), pp. 60–71 (1958)
Liberman, E., Hauert, C., Nowak, M.A.: Evolutionary dynamics on graphs. Nature 433(7023), 312–316 (2005)
Hauert, C.: Evolutionary dynamics. In: Skjeltorp, A.T., Belushkin, A.V. (eds.) Proceedings of the NATO Advanced Study Institute on Evolution From Cellular to Social Scales, pp. 11–44. Springer, Dordrecht (2008)
Voorhees, B.: Birth-death fixation probabilities for structured populations (preprint, 2012)
Broom, M., Rychtár, J.: An analysis of the fixation probability of a mutant on special classes of non-directed graphs. Proceedings of the Royal Society A 464, 2609–2627 (2008)
Nowak, M.A., Tarnita, C.E., Antal, T.: Evolutionary dynamics in structured populations. Philosophical Transactions of the Royal Society B 365, 19–30 (2010)
Banerjee, A.: The Spectrum of the Graph Laplacian as a Tool for Analyzing Structure and Evolution of Networks. Dissertation (Dr. rer. nat.), University of Leipzig (2008)
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
Voorhees, B. (2012). Introducing Innovation in a Structured Population. 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_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_26
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)