scholarly journals Graph-structured populations and the Hill–Robertson effect

2021 ◽  
Vol 8 (3) ◽  
Author(s):  
Peter A. Whigham ◽  
Hamish G. Spencer

The Hill–Robertson effect describes how, in a finite panmictic diploid population, selection at one diallelic locus reduces the fixation probability of a selectively favoured allele at a second, linked diallelic locus. Here we investigate the influence of population structure on the Hill–Robertson effect in a population of size N . We model population structure as a network by assuming that individuals occupy nodes on a graph connected by edges that link members who can reproduce with each other. Three regular networks (fully connected, ring and torus), two forms of scale-free network and a star are examined. We find that (i) the effect of population structure on the probability of fixation of the favourable allele is invariant for regular structures, but on some scale-free networks and a star, this probability is greatly reduced; (ii) compared to a panmictic population, the mean time to fixation of the favoured allele is much greater on a ring, torus and linear scale-free network, but much less on power-2 scale-free and star networks; (iii) the likelihood with which each of the four possible haplotypes eventually fix is similar across regular networks, but scale-free populations and the star are consistently less likely and much faster to fix the optimal haplotype; (iv) increasing recombination increases the likelihood of fixing the favoured haplotype across all structures, whereas the time to fixation of that haplotype usually increased, and (v) star-like structures were overwhelmingly likely to fix the least fit haplotype and did so significantly more rapidly than other populations. Last, we find that small ( N < 64) panmictic populations do not exhibit the scaling property expected from Hill & Robertson (1966 Genet. Res. 8 , 269–294. ( doi:10.1017/S0016672300010156 )).

2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.


2018 ◽  
Vol 35 (1) ◽  
pp. 123-132 ◽  
Author(s):  
Lei Zhu ◽  
Lei Wang ◽  
Xiang Zheng ◽  
Yuzhang Xu

Sign in / Sign up

Export Citation Format

Share Document