On convergence and threshold properties of discrete lotka-volterra population protocols

Jurek Czyzowicz, Leszek Ģasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemysław Uznański

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

In this work we focus on a natural class of population protocols whose dynamics are modeled by the discrete version of Lotka-Volterra equations with no linear term. In such protocols, when an agent a of type (species) i interacts with an agent b of type (species) j with a as the initiator, then b’s type becomes i with probability Pij. In such an interaction, we think of a as the predator, b as the prey, and the type of the prey is either converted to that of the predator or stays as is. Such protocols capture the dynamics of some opinion spreading models and generalize the well-known Rock-Paper-Scissors discrete dynamics. We consider the pairwise interactions among agents that are scheduled uniformly at random. We start by considering the convergence time and show that any Lotka-Volterra-type protocol on an n-agent population converges to some absorbing state in time polynomial in n, w. h. p., when any pair of agents is allowed to interact. By contrast, when the interaction graph is a star, there exist protocols of the considered type, such as Rock-Paper-Scissors, which require exponential time to converge. We then study threshold effects exhibited by Lotka-Volterra-type protocols with 3 and more species under interactions between any pair of agents. We present a simple 4-type protocol in which the probability difference of reaching the two possible absorbing states is strongly amplified by the ratio of the initial populations of the two other types, which are transient, but “control” convergence. We then prove that the Rock-Paper-Scissors protocol reaches each of its three possible absorbing states with almost equal probability, starting from any configuration satisfying some sub-linear lower bound on the initial size of each species. That is, Rock-Paper-Scissors is a realization of a “coin-flip consensus” in a distributed system. Some of our techniques may be of independent value.

Original languageEnglish (US)
Title of host publicationAutomata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings
EditorsMagnus M. Halldorsson, Naoki Kobayashi, Bettina Speckmann, Kazuo Iwama
PublisherSpringer Verlag
Pages393-405
Number of pages13
ISBN (Print)9783662476710
DOIs
StatePublished - 2015
Event42nd International Colloquium on Automata, Languages and Programming, ICALP 2015 - Kyoto, Japan
Duration: Jul 6 2015Jul 10 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9134
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference42nd International Colloquium on Automata, Languages and Programming, ICALP 2015
CountryJapan
CityKyoto
Period7/6/157/10/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On convergence and threshold properties of discrete lotka-volterra population protocols'. Together they form a unique fingerprint.

  • Cite this

    Czyzowicz, J., Ģasieniec, L., Kosowski, A., Kranakis, E., Spirakis, P. G., & Uznański, P. (2015). On convergence and threshold properties of discrete lotka-volterra population protocols. In M. M. Halldorsson, N. Kobayashi, B. Speckmann, & K. Iwama (Eds.), Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings (pp. 393-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9134). Springer Verlag. https://doi.org/10.1007/978-3-662-47672-7_32