Interacting growth processes and invariant percolation

A class of non homogeneous self interacting random processes with applications to learning in games and vertex-reinforced random walks... hal-00284649, version 1 - 4

Moreover, provided the number of waiting in the queue (in pool 1) class-1 customers exceeds a given threshold C, an arbitrary class-1 customer waiting in the 1st queue, can jump to

Requests for a single file arrive at rate λ , the first component X 0 (t) is the number of requests which did not get the file, whereas the second component is the number of

A nowadays classical technique of studying subcritical branching processes in random environment (see, for instance, [14, 4, 2, 3] ) is similar to that one used to investigate

random variables, each with the distribution of the effective resistance be- tween the root and infinity in a Galton–Watson tree with a supercritical Poisson offspring distribution..

To complete the proof of Theorem 5.1, we first observe that the genealogy of particles close to the minimal displacement at time n in the branching random walk are either

The notion of excess was first used in [29] where the author obtained substantial enumerative results in the study of connected graphs according to the two parameters number of

The present paper has been devoted to develop criteria based on stochastic Lyapunov technique in order to establish sufficient conditions for the existence of invariant