Abstract
Abstract Fixation time of evolutionary processes on graph-structured populations is highly affected by the underlying graph structure. In this article, we study the spreading of a single mutant on trees. We show that the number of leaves (terminal nodes) plays a crucial role in the fixation process. Our results show that the fastest fixation process occurs when approximately $\frac{1}{4}$ of nodes are leaves. Estimated fixation time based on the number of leaves in tree graphs is valid even when the tree is generated by specific mechanisms and has specific topologies and degree distributions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
