Related papers: Fitness Probability Distribution of Bit-Flip Mutat…
This paper introduces the multivariate beta mixture model (MBMM), a new probabilistic model for soft clustering. MBMM adapts to diverse cluster shapes because of the flexible probability density function of the multivariate beta…
An equation describing the evolution of phenotypic distribution is derived using methods developed in statistical physics. The equation is solved by using the singular perturbation method, and assuming that the number of bases in the…
In this paper, we address the problem of finding a correspondence, or matching, between the functions of two programs in binary form, which is one of the most common task in binary diffing. We introduce a new formulation of this problem as…
Recent work on weighted model counting has been very successfully applied to the problem of probabilistic inference in Bayesian networks. The probability distribution is encoded into a Boolean normal form and compiled to a target language,…
A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in…
The mutual information of bit-interleaved coded modulation (BICM) systems, sometimes called the BICM capacity, is investigated at low signal-to-noise ratio (SNR), i.e., in the wideband regime. A new linear transform that depends on bits'…
Multitype branching processes are ideal for studying the population dynamics of stem cell populations undergoing mutation accumulation over the years following transplant. In such stochastic models, several quantities are of clinical…
The presence of symmetries of binary programs typically degrade the performance of branch-and-bound solvers. In this article, we derive efficient variable fixing algorithms to discard symmetric solutions from the search space based on…
We study the evolution of large but finite asexual populations evolving in fitness landscapes in which all mutations are either neutral or strongly deleterious. We demonstrate that despite the absence of higher fitness genotypes, adaptation…
Selection in a time-periodic environment is modeled via the continuous-time two-player replicator dynamics, which for symmetric pay-offs reduces to the Fisher equation of mathematical genetics. For a sufficiently rapid and cyclic…
A significant obstacle in the development of robust machine learning models is covariate shift, a form of distribution shift that occurs when the input distributions of the training and test sets differ while the conditional label…
We compute the full probability distribution of the spectral form factor in the self-dual kicked Ising model by providing an exact lower bound for each moment and verifying numerically that the latter is saturated. We show that at large…
Power-law probability distributions arise often in the social and natural sciences. Statistics have been developed for estimating the exponent parameter as well as gauging goodness-of-fit to a power law. Yet paradoxically, many famous power…
We present a general procedure for obtaining the present density fluctuation probability distribution given the statistics of the initial conditions. The main difficulties faced with regard to this problem are those related to the…
We present a number of bounds on convergence time for two elitist population-based Evolutionary Algorithms using a recombination operator k-Bit-Swap and a mainstream Randomized Local Search algorithm. We study the effect of distribution of…
We explore the class of exchangeable Bernoulli distributions building on their geometrical structure. Exchangeable Bernoulli probability mass functions are points in a convex polytope and we have found analytical expressions for their…
The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in…
The computation of two Bayesian predictive distributions which are discrete mixtures of incomplete beta functions is considered. The number of iterations can easily become large for these distributions and thus, the accuracy of the result…
The Exact Circular Pattern Matching (ECPM) problem consists of reporting every occurrence of a rotation of a pattern $P$ in a text $T$. In many real-world applications, specifically in computational biology, circular rotations are of…
For a distribution $p:=\{p_k\}_{k=1}^\infty$ on the positive integers, there are two natural ways to construct a random permutation in $S_n$ or of $\mathbb{N}$ from IID samples from $p$--the $p$-biased construction and the $p$-shifted…