Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.11121

An algorithm to represent inbreeding trees

C. Jarne·F A. Gómez Albarracín·M. Caruso
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees and diversity. Groups with a finite number of individuals could give a variety of genetic relationships. { In previous works \cite{PhysRevE.92.052132, PhysRevE.90.022125, JARNE20191}, we have addressed the issue of building inbreeding trees for biparental reproduction using Markovian models. Here, we extend these studies by presenting an algorithm to generate and represent inbreeding trees with no overlapping generations. We explicitly assume a two-gender reproductory scheme, and we pay particular attention to the links between nodes. We show that even for a simple case with a relatively small number of nodes in the tree, there are a large number of possible ways to rearrange the links between generations. We present an open-source python code to generate the tree graph, the adjacency matrix, and the histogram of the links for each different tree representation. We show how this mapping reflects the difference between tree realizations, and how valuable information may be extracted upon inspection of these matrices. The algorithm includes a feature to average several tree realizations, obtain the connectivity distribution, and calculate the average and mean value. We used this feature to compare trees with a different number of generations and nodes. The code presented here, available in Git-Hub, may be easily modified to be applied to other areas of interest involving connections between individuals, extend the study to add more characteristics of the different nodes, etc.

Explore related subjects

q-bio.PE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

C. Jarne, F A. Gómez Albarracín, M. Caruso. 2021-02-01. An algorithm to represent inbreeding trees. https://doi.org/10.1016/j.physa.2021.125894

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A conceptual predator-prey model with super-long transients

Drawing on the understanding of the logistic map, we propose a simple predator-prey model where predators and prey adapt to each other, leading to the co-evolution of the system. The special dynamics observed in periodic windows contribute to the coexistence of multiple time scales, adding to the complexity of the system. Typical dynamics in ecosystems, such as the persistence and coexistence of population cycles and chaotic behaviors, the emergence of super-long transients, regime shifts, and the quantifying of resilience, are encapsulated within this single model. The simplicity of our model allows for detailed analysis, reinforcing its potential as a conceptual tool for understanding ecosystems deeply.

q-bio.PE↗
arXiv2026

Mutation Order and Selection Shape Intratumor Heterogeneity in Tumor Evolution

Cancer progression often requires multiple driver mutations, but the same drivers may be acquired in different orders. How these pathways jointly shape tumor clonal structure remains unclear. We develop a multitype branching-process model in which malignant transformation requires two driver mutations, distinguishing malignant cells by mutation order and the independent transformation event that founded their clone. Under a successive exponential approximation, we establish point-process limits for pathway-specific clone sizes and derive a closed-form expression for the limiting expected Simpson's index of the combined malignant population. When both mutation orders yield malignant cells with the same net growth rate, the index decomposes into effective pathway weights, determined by mutation rates and birth-death dynamics at preceding stages, and within-pathway concentration terms, determined by intermediate-to-malignant growth-rate ratios. A driver's effect on heterogeneity thus depends critically on when it is acquired. A strong driver acquired early expands the intermediate lineage and increases the supply of independent malignant founders, whereas the same driver acquired last strengthens the growth and age advantage of early-founded malignant clones. Under additive fitness effects, these opposing mechanisms can produce a non-monotone relationship between selective advantage and clonal concentration. Threshold-like non-additive fitness effects can generate highly concentrated malignant populations, while order-dependent terminal fitness causes the faster-growing pathway to dominate asymptotically. These results show how mutation order, mutational accessibility, selection, and epistasis jointly determine lineage-level intratumor heterogeneity.

q-bio.PE↗
arXiv2026

Phase transitions in microbial lineage trees

Microbial populations exhibit high cell-to-cell variability, which fundamentally shapes population behavior. A striking consequence is the existence of phase transitions, where small genetic or environmental changes trigger abrupt shifts in population dynamics. While biological phase transitions have often been proposed, connecting observed behavior to the underlying physics has remained challenging. We combine population genetics with statistical physics to show how phase transitions arise naturally in microbial populations. We highlight the existence of a first-order transition in a model of bacterial plasmid engineering and find a strict lower bound on the number of plasmids that can be stably maintained in a population.

q-bio.PE↗