Figure - PMC

Skip to main content

An official website of the United States government

Here's how you know

Here's how you know

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

View full-text article in PMC

. 2023 Nov 29;20(208):20230355. doi: 10.1098/rsif.2023.0355

Search in PMC
Search in PubMed
View in NLM Catalog
Add to search

© 2023 The Authors.

Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.

PMC Copyright notice

Figure 3. — Small populations N = 3. (a) There are four connected graphs G⁰, …, G³ on N = 3 labelled nodes. (b) The fixation probabilities ρ(G^A, G^B) for all 4 · 4 = 16 combinations. (c) When G^A and G^B are isomorphic but not identical, the fixation probability is not necessarily equal to 1/N. For instance, we have $ρ (S_{4}, S_{4}^{'}) = 63 / 208 ≐ 0.303$ .