A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Takeover time curves in random and small-world structured populations
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Evolvability Suppression to Stabilize Far-Sighted Adaptations
Artificial Life
Takeover times on scale-free topologies
Proceedings of the 9th annual conference on Genetic and evolutionary computation
An analysis of the effects of population structure on scalable multiobjective optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary dynamics for the spatial Moran process
Genetic Programming and Evolvable Machines
The influence of scaling and assortativity on takeover times in scale-free topologies
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Pair approximations of takeover dynamics in regular population structures
Evolutionary Computation
Multiobjective evolutionary algorithms on complex networks
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Effects of scale-free and small-world topologies on binary coded self-adaptive CEA
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A parallel genetic algorithm for performance-driven VLSI routing
IEEE Transactions on Evolutionary Computation
Gradual distributed real-coded genetic algorithms
IEEE Transactions on Evolutionary Computation
Markov chain models of parallel genetic algorithms
IEEE Transactions on Evolutionary Computation
Parallel hybrid method for SAT that couples genetic algorithms andlocal search
IEEE Transactions on Evolutionary Computation
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A scalable cellular implementation of parallel genetic programming
IEEE Transactions on Evolutionary Computation
Considerations in engineering parallel multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
The exploration/exploitation tradeoff in dynamic cellular genetic algorithms
IEEE Transactions on Evolutionary Computation
Selection intensity in cellular evolutionary algorithms for regular lattices
IEEE Transactions on Evolutionary Computation
Graph-based evolutionary algorithms
IEEE Transactions on Evolutionary Computation
The Self-Organization of Interaction Networks for Nature-Inspired Optimization
IEEE Transactions on Evolutionary Computation
Effect of topology on diversity of spatially-structured evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Scale-free fully informed particle swarm optimization algorithm
Information Sciences: an International Journal
Sexual recombination in self-organizing interaction networks
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Hi-index | 0.00 |
There has been a recent surge of interest in studying dynamical processes, including evolutionary optimization, on scale-free topologies. While various scaling parameters and assortativities have been observed in natural scale-free interaction networks, most previous studies of dynamics on scale-free graphs have employed a graph-generating algorithm that yields a topology with an uncorrelated degree distribution and a fixed scaling parameter. In this paper, we advance the understanding of selective pressure in scale-free networks by systematically investigating takeover times under local uniform selection in scalefree topologies with varying scaling exponents, assortativities, average degrees, and numbers of vertices. We demonstrate why the so-called characteristic path length of a graph is a nonlinear function of both scaling and assortativity. Neither the eigenvalues of the adjacency matrix nor the effective population size was sufficient to account for the variance in takeover times over the parameter space that was explored. Rather, we show that 97% of the variance of logarithmically transformed average takeover times, on all scale-free graphs tested, could be accounted for by a planar function of: 1) the average inverse degree (which captures the effects of scaling) and 2) the logarithm of the population size. Additionally, we show that at low scaling exponents, increasingly positive assortativities increased the variability between experiments on different random graph instances, while increasingly negative assortativities increased the variability between takeover times from different initial conditions on the same graph instances. We explore the mechanisms behind our sometimes counterintuitive findings, and discuss potential implications for evolutionary computation and other relevant disciplines.