#### Filter Results:

#### Publication Year

1995

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Raphaël Cerf
- 1999

We consider the problem of bootstrap percolation on a three dimensional lattice and we study its finite size scaling behavior. Bootstrap percolation is an example of Cellular Automata defined on the d-dimensional lattice {1, 2, ..., L} d in which each site can be empty or occupied by a single particle; in the starting configuration each site is occupied… (More)

We study the metastability of the stochastic three dimensional Ising model on a finite torus under a small positive magnetic field at very low temperatures. Abstract. We study the metastability of the stochastic three dimensional Ising model on a finite torus under a small positive magnetic field at very low temperatures.

- RAPHAËL CERF
- 1999

We prove a large deviation principle for Minkowski sums of i.i.d. random compact sets in a Banach space, that is, the analog of Cramér theorem for random compact sets. Several works have been devoted to deriving limit theorems for random sets. For i.i.d. random compact sets in R p , the law of large numbers was initially proved by Artstein and Vitale [1]… (More)

- Raphaël Cerf
- Artificial Evolution
- 1995

- Laurent Alonso, Raphaël Cerf
- Electr. J. Comb.
- 1996

The set of the three dimensional polyominoes of minimal area and of volume n contains a polyomino which is the union of a quasicube j × (j + δ) × (j + θ), δ, θ ∈ {0, 1}, a quasisquare l × (l +), ∈ {0, 1}, and a bar k. This shape is naturally associated to the unique decomposition of n = j(j + δ)(j + θ) + l(l +) + k as the sum of a maximal quasicube, a… (More)

- Raphaël Cerf
- ArXiv
- 2010

Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability and the population size of a genetic algorithm. Genetic algorithms are widely used nowadays, as well as their cousins evolutionary algorithms. The most cited initial references on… (More)

- Raphaël Cerf
- ArXiv
- 2014

We study the simple genetic algorithm with a ranking selection mechanism (linear ranking or tournament). We denote by ℓ the length of the chromosomes, by m the population size, by pC the crossover probability and by pM the mutation probability. We introduce a parameter σ, called the selection drift, which measures the selection intensity of the fittest… (More)

- Raphaël Cerf, Pierre Petit
- The American Mathematical Monthly
- 2011

Infinite permutations of lowest maximal pattern complexity (to appear). On periodicity and low complexity of infinite permutations, Euro-pean J. Abstract. We give a short proof of Cramér's large deviations theorem based on convex duality. This proof does not resort to the law of large numbers or any other limit theorem. The most fundamental result in… (More)

We consider the 2D stochastic Ising model evolving according to the Glauber dynamics at zero temperature. We compute the initial drift for droplets which are suitable approximations of smooth domains. A specific spatial average of the derivative at time 0 of the volume variation of a droplet close to a boundary point is equal to its curvature multiplied by… (More)