The influence of scaling and assortativity on takeover times in scale-free topologies
Author(s) -
Joshua L. Payne,
Margaret J. Eppstein
Publication year - 2008
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1389095.1389133
Subject(s) - assortativity , scaling , network topology , population , scale free network , statistical physics , topology (electrical circuits) , scale (ratio) , computer science , nonlinear system , complex network , physics , mathematics , combinatorics , quantum mechanics , computer network , geometry , demography , sociology , world wide web
In evolving systems, the topological characteristics of population structure have a pronounced impact on the rate of spread of advantageous alleles, and therefore affect selective pressure. One common method for quantifying the influence of population structure on selective pressure is through the analysis of the expected number of generations required for a single favorable allele to saturate an entire population (a.k.a. takeover time analysis). While takeover times have been thoroughly investigated in regular population structures, the selective pressures induced by irregular interaction topologies, such as scale-free graphs, have received much less attention. In this study, we systematically investigate the influence of scaling and assortativity, two frequently overlooked topological properties, on takeover times in scale-free population structures. Our results demonstrate that the scaling parameter and the magnitude and sign of assortativity have profound and unexpected nonlinear influences on takeover times in scale-free interaction topologies. We explore the reasons behind these results and suggest ways in which they may be exploited in future studies.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom