SearcharxivSearch

arXiv · 1408.5036

The stochastic encounter-mating model

Abstract

We propose a new model of permanent monogamous pair formation in zoological populations with multiple types of females and males. According to this model, animals randomly encounter members of the opposite sex at their so-called firing times to form temporary pairs which then become permanent if mating happens. Given the distributions of the firing times and the mating preferences upon encounter, we analyze the contingency table of permanent pair types in three cases: (i) definite mating upon encounter; (ii) Poisson firing times; and (iii) Bernoulli firing times. In the first case, the contingency table has a multiple hypergeometric distribution which implies panmixia. The other two cases generalize the encounter-mating models of Gimelfarb (1988) who gives conditions that he conjectures to be sufficient for panmixia. We formulate adaptations of his conditions and prove that they not only characterize panmixia but also allow us to reduce the model to the first case by changing its underlying parameters. Finally, when there are only two types of females and males, we provide a full characterization of panmixia, homogamy and heterogamy.

Explore related subjects

Keep this discovery

BibTeXRIS

Onur Gün, Atilla Yilmaz. 2014-08-21. The stochastic encounter-mating model. https://arxiv.org/abs/1408.5036

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