The survival of the weakest in networks

Authors:
S. Nikoletseas;C. Raptopoulos;P. Spirakis
Affiliations:
Computer Technology Institute, Patras, Greece 26110 and University of Patras, Patras, Greece 26500;Computer Technology Institute, Patras, Greece 26110 and University of Patras, Patras, Greece 26500;Computer Technology Institute, Patras, Greece 26110 and University of Patras, Patras, Greece 26500
Venue:
Computational & Mathematical Organization Theory
Year:
2009

Citing 3
Cited 1

On a random walk problem arising in self-stabilizing token management

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Meeting times of random walks on graphs

Information Processing Letters
Probability Models for Computer Science

Probability Models for Computer Science

Preface to special issue on cooperation in selfish systems

Computational & Mathematical Organization Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study here dynamic antagonism in a fixed network, represented as a graph G of n vertices. In particular, we consider the case of k驴n particles walking randomly independently around the network. Each particle belongs to exactly one of two antagonistic species, none of which can give birth to children. When two particles meet, they are engaged in a (sometimes mortal) local fight. The outcome of the fight depends on the species to which the particles belong. Our problem is to predict (i.e. to compute) the eventual chances of species survival. We prove here that this can indeed be done in expected polynomial time on the size of the network, provided that the network is undirected.