SearcharxivSearch

arXiv · 2605.02499

Genealogical structures under interactive neutral reproduction: factorial moment duality via a Frankenstein process

Abstract

We establish a genealogical framework for an existing analytical moment duality between a Wright--Fisher type SDE and a counting process with interaction. To achieve this, we construct a finite-population Moran model featuring interactive neutral reproduction as a novel mechanism. In the corresponding events, an individual, regardless of its own type, can only reproduce if a randomly encountered partner is of the ``fit'' type. This Moran model has a relatively simple counting process as its factorial moment dual, whose genealogical meaning appears to be cryptic: after all, the line-counting process of the natural genealogical process of the model, namely the ancestral influence graph (AIG), exhibits a complex hierarchical structure not reflected in the factorial moment dual. Since moment duality is a property in expectation, we are allowed to systematically remove information from the AIG and merge different realizations of the ancestry. We call the result the \emph{Frankenstein process}. Based on this, we establish the factorial moment duality from a genealogical perspective. The moment duality in the diffusion limit follows in a natural way.

Explore related subjects

Keep this discovery

BibTeXRIS

Ellen Baake, Fernando Cordero, Hannah Dopmeyer. 2026-05-04. Genealogical structures under interactive neutral reproduction: factorial moment duality via a Frankenstein process. https://arxiv.org/abs/2605.02499

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR