Justification of Sexual Reproduction by Modified Penna Model of Ageing

We generalize the standard Penna bit-string model of biological ageing by assuming that each deleterious mutation diminishes the survival probability in every time interval by a small percentage. This effect is added to the usual lethal but age-dependent effect of the same mutation. We then find strong advantages or disadvantages of sexual reproduction (with males and females) compared to asexual cloning, depending on parameters.Comment: 4 pages, 2 figures, submitted to Physica

Bonabeau hierarchy models revisited

What basic processes generate hierarchy in a collective? The Bonabeau model provides us a simple mechanism based on randomness which develops self-organization through both winner/looser effects and relaxation process. A phase transition between egalitarian and hierarchic states has been found both analytically and numerically in previous works. In this paper we present a different approach: by means of a discrete scheme we develop a mean field approximation that not only reproduces the phase transition but also allows us to characterize the complexity of hierarchic phase. In the same philosophy, we study a new version of the Bonabeau model, developed by Stauffer et al. Several previous works described numerically the presence of a similar phase transition in this later version. We find surprising results in this model that can be interpreted properly as the non-existence of phase transition in this version of Bonabeau model, but a changing in fixed point structure

Threshold value of three dimensional bootstrap percolation

The following article deals with the critical value p_c of the three-dimensional bootstrap percolation. We will check the behavior of p_c for different lengths of the lattice and additionally we will scale p_c in the limit of an infinite lattice.Comment: 8 pages including 9 figures for Int.J.Mod.Phys.

Space-time percolation and detection by mobile nodes

Consider the model where nodes are initially distributed as a Poisson point process with intensity $\lambda$ over $\mathbb{R}^d$ and are moving in continuous time according to independent Brownian motions. We assume that nodes are capable of detecting all points within distance $r$ of their location and study the problem of determining the first time at which a target particle, which is initially placed at the origin of $\mathbb{R}^d$, is detected by at least one node. We consider the case where the target particle can move according to any continuous function and can adapt its motion based on the location of the nodes. We show that there exists a sufficiently large value of $\lambda$ so that the target will eventually be detected almost surely. This means that the target cannot evade detection even if it has full information about the past, present and future locations of the nodes. Also, this establishes a phase transition for $\lambda$ since, for small enough $\lambda$, with positive probability the target can avoid detection forever. A key ingredient of our proof is to use fractal percolation and multi-scale analysis to show that cells with a small density of nodes do not percolate in space and time.Comment: Published at http://dx.doi.org/10.1214/14-AAP1052 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

The Sznajd model of consensus building with limited persuasion

The Sznajd model, where two people having the same opinion can convince their neighbours on the square lattice, is modified in the sense of Deffuant et al and Hegselmann, that only neighbours of similar opinions can be convinced. Then consensus is easy for the competition of up to three opinions but difficult for four and more opinions.Comment: Two pages, no figures, Int. J. Mod. Phys. C 13, No.