Related papers: Late levels of nested occupancy scheme in random e…
Representations of population models in terms of countable systems of particles are constructed, in which each particle has a `type', typically recording both spatial position and genetic type, and a level. For finite intensity models, the…
For most organisms with viscous population structure, spatially localized growth drives the invasive advance of a favorable mutation. We model a two-allele competition where recurrent mutation introduces a genotype with a rate of local…
We consider a critical branching process $Y_{n}$ in an i.i.d. random environment, in which one immigrant arrives at each generation. Let $% \mathcal{A}_{i}(n)$ be the event that all individuals alive at time $n$ are offspring of the…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If $d \ge 3$ and the environment is "not too random", then, the total…
A graph $d$-process starts with an empty graph on $n$ vertices, and adds one edge at each time step, chosen uniformly at random from those pairs which are not yet edges and whose both vertices have current degree less than $d$. If, in the…
We introduce a new class of balanced allocation processes which are primarily characterized by ``filling'' underloaded bins. A prototypical example is the Packing process: At each round we only take one bin sample, if the load is below the…
We consider a critical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We are interested in the event $\mathcal{A}_i(n)$ that all individuals alive at time $n$ are offspring of the…
Motivated by a seminal paper of Kesten et al. (1975) we consider a branching process with a geometric offspring distribution with i.i.d. random environmental parameters $A_n$, $n\ge 1$ and size -1 immigration in each generation. In contrast…
Consider a population whose size changes stepwise by its members reproducing or dying (disappearing), but is otherwise quite general. Denote the initial (non-random) size by $Z_0$ and the size of the $n$th change by $C_n$, $n= 1, 2,…
The zero range process is of particular importance as a generic model for domain wall dynamics of one-dimensional systems far from equilibrium. We study this process in one dimension with rates which induce an effective attraction between…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
We study numerically a model of nonequilibrium networks where nodes and links are added at each time step with aging of nodes and connectivity- and age-dependent attachment of links. By varying the effects of age in the attachment…
Comprehensive models of stochastic, clonally reproducing populations are defined in terms of general branching processes, allowing birth during maternal life, as for higher organisms, or by splitting, as in cell division. The populations…
We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation $k$ branch into the same random number of particles $\mathcal{L}_{k+1}\ge 2$, where the $\mathcal{L}_k$, $k\in\mathbb{N}$,…
Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
The first chapter concerns monotype population models. We first study general birth and death processes and we give non-explosion and extinction criteria, moment computations and a pathwise representation. We then show how different scales…
We model stochastic choice as environment-dependent switching among a small library of deterministic decision rules. A Random Rule Model generates menu-level choice probabilities via named, interpretable rules weighted by observable menu…