Related papers: Selection, recombination, and the ancestral initia…
The deterministic selection-recombination equation describes the evolution of the genetic type composition of a population under selection and recombination in a law of large numbers regime. So far, an explicit solution has seemed out of…
We reconsider the deterministic haploid mutation-selection equation with two types. This is an ordinary differential equation that describes the type distribution (forward in time) in a population of infinite size. This paper establishes…
We consider the mutation--selection differential equation with pairwise interaction (or, equivalently, the diploid mutation--selection equation) and establish the corresponding ancestral process, which is a random tree and a variant of the…
We review recent progress on ancestral processes related to mutation-selection models, both in the deterministic and the stochastic setting. We mainly rely on two concepts, namely, the killed ancestral selection graph and the pruned…
Understanding patterns of selectively neutral genetic variation is essential in order to model deviations from neutrality, caused for example by different forms of selection. Best understood is neutral genetic variation at a single locus,…
Understanding the interplay between recombination and resampling is a significant challenge in mathematical population genetics and of great practical relevance. Asymptotic results about the distribution of samples when recombination is…
Solving the recombination equation has been a long-standing challenge of \emph{deterministic} population genetics. We review recent progress obtained by introducing ancestral processes, as traditionally used in the context of…
In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one…
Consider a genetic locus carrying a strongly beneficial allele which has recently fixed in a large population. As strongly beneficial alleles fix quickly, sequence diversity at partially linked neutral loci is reduced. This phenomenon is…
For a genetic locus carrying a strongly beneficial allele which has just fixed in a large population, we study the ancestry at a linked neutral locus. During this ``selective sweep'' the linkage between the two loci is broken up by…
In an effort to effectively model observed patterns in the spatial configuration of individuals of multiple species in nature, we introduce the saturated pairwise interaction Gibbs point process. Its main strength lies in its ability to…
Genetic hitchhiking describes evolution at a neutral locus that is linked to a selected locus. If a beneficial allele rises to fixation at the selected locus, a characteristic polymorphism pattern (so-called selective sweep) emerges at the…
We propose a greedy search-and-score algorithm for ancestral graphs, which include directed as well as bidirected edges, originating from unobserved latent variables. The normalized likelihood score of ancestral graphs is estimated in terms…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
Choosing the placement of wildlife crossings (i.e., green bridges) to reconnect animal species' fragmented habitats is among the 17 goals towards sustainable development by the UN. We consider the following established model: Given a graph…
Link prediction is an important learning task for graph-structured data. In this paper, we propose a novel topological approach to characterize interactions between two nodes. Our topological feature, based on the extended persistent…
Landmarks have long played a pivotal role in automated planning, serving as crucial elements for improving the planning algorithms. The main limitation of classical landmark extraction methods is their sensitivity to specific planning…
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
In this paper, we propose a graph classification approach for automatically determining whether to use a monolithic or a decomposition-based solution method. In this approach, an optimization problem is represented as a graph that captures…
A biologically motivated individual-based framework for evolution in network-structured populations is developed that can accommodate eco-evolutionary dynamics. This framework is used to construct a network birth and death model. The…