paper-with-me

Papers

Coalescent processes emerging from large deviations

2023-08-28 · Ethan Levien

The classical model for the genealogies of a neutrally evolving population in a fixed environment is due to Kingman. Kingman's coalescent process, which produces a binary tree, universally emerges from many microscopic models in which the variance in the number of offspring is finite. It is understood that power-law offspring distributions with infinite variance can result in a very different type of coalescent structure with merging of more than two lineages. Here we investigate the regime where the variance of the offspring distribution is finite but comparable to the population size. This is achieved by studying a model in which the log offspring sizes have a stretched exponential form. Such offspring distributions are motivated by biology, where they emerge from a toy model of growth in a heterogenous environment, but also mathematics and statistical physics, where limit theorems and phase transitions for sums over random exponentials have received considerable attention due to their appearance in the partition function of Derrida's Random Energy Model (REM). We find that the limit coalescent is a $\beta$-coalescent -- a previously studied model emerging from evolutionary dynamics models with heavy-tailed offspring distributions. We also discuss the connection to previous results on the REM.

📄 PDF Abstract BibTeX arXiv:2308.14715

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
DQN A DQN, or Deep Q-Network, approximates a state-value function in a Q-Learning framework with a neural network. In the Atari…
REM Random Ensemble Mixture (REM) is an easy to implement extension of DQN inspired by Dropout.…

Similar Papers 제목 키워드 기반

The seed bank coalescent with simultaneous switching

2018-12-21

We introduce a new Wright-Fisher type model for seed banks incorporating "simultaneous switching", which is motivated by recent work on microbial dormancy. We show that the simultaneous switching mechanism leads to a new…

The site frequency spectrum for general coalescents

2016-02-11

General genealogical processes such as $\Lambda$- and $\Xi$-coalescents, which respectively model multiple and simultaneous mergers, have important applications in studying marine species, strong positive selection, recu…

Enumeration of coalescent histories for caterpillar species trees and $p$-pseudocaterpillar gene trees

2021-03-24 · Egor Alimpiev, Noah A Rosenberg

For a fixed set $X$ containing $n$ taxon labels, an ordered pair consisting of a gene tree topology $G$ and a species tree $S$ bijectively labeled with the labels of $X$ possesses a set of coalescent histories -- mapping…

Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees

2019-01-14

Given a gene tree topology and a species tree topology, a coalescent history represents a possible mapping of the list of gene tree coalescences to associated branches of a species tree on which those coalescences take p…

Binary to Bushy: Bayesian Hierarchical Clustering with the Beta Coalescent

2013-12-01 · NeurIPS 2013 12 · Yuening Hu, Jordan L. Ying, Hal Daume III, Z. Irene Ying

Discovering hierarchical regularities in data is a key problem in interacting with large datasets, modeling cognition, and encoding knowledge. A previous Bayesian solution---Kingman's coalescent---provides a convenie…

Clustering