SearcharxivSearch

arXiv · math/0701656

Splitting pairs and the number of clusters generated by random pair incompatibilities

Abstract

We consider a random fitness landscape on the space of haploid diallelic genotypes with n genetic loci, where each genotype is considered either inviable or viable depending on whether or not there are any incompatibilities among its allele pairs. We suppose that each allele pair in the set of all possible allele pairs on the n loci is independently incompatible with probability p=c/(2n). We examine the connectivity of the viable genotypes under single locus mutations and show that, for 0 1, there are no viable genotypes with probability converging to one. The genotype space is equivalent to the n-dimensional hypercube and the viable genotypes are solutions to a random 2-SAT problem, so the same result holds for the connectivity of solutions in the hypercube to a random 2-SAT problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Damien Pitman. 2007-01-24. Splitting pairs and the number of clusters generated by random pair incompatibilities. https://arxiv.org/abs/math/0701656

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