activity
20142026
most citedProbabilistic cellular automata with general alphabets letting a Markov chain invariant

2 citations · 5 across the 12 of their papers we have counts for

collaborators

14 papers

math.PR2026

Gilbert's disc model conditioned on the square lattice

Jérôme Casse, Irène Marcovici, Maxence Poutrel

We present a new percolation model on the two-dimensional lattice, which can be seen as a conditioned version of continuous percolation on the plane. Let us place a point uniformly…

math.PR2025

Ergodicity of the hard-core PCA with a random walk method

Jérôme Casse, Irène Marcovici, Maxence Poutrel

The hard-core probabilistic cellular automaton has attracted a renewed interest in the last few years, thanks to its connection with the study of a combinatorial game on percolatio…

math.PR2024

Quasi-reversible bullet models: colliding bullet model with creations and a new(?) loop model

Jérôme Casse

We consider a large class of bullet models that contains, in particular, the colliding bullet model with creations and a new loop model. For this large class of bullet models, we g…

math.PR2024

Random trees with local catastrophes: the Brownian case

Ariane Carrance, Jérôme Casse, Nicolas Curien

We introduce and study a model of plane random trees generalizing the famous Bienaymé--Galton--Watson model but where births and deaths are locally correlated. More precisely, give…

math.PR2023★ 1 cited

Siblings in d-dimensional nearest neighbour trees

Jérôme Casse

Pick a sequence of uniform points on the -dimensional sphere. Then, link the th point to its closest one that arrives in the past. This constructs a labelled tree called the…

math.PR2022

Ergodicity of some probabilistic cellular automata with two letters alphabet via random walks

Jérôme Casse

Ergodicity of probabilistic cellular automata is a very important issue in the PCA theory. In particular, the question about the ergodicity of all PCA with two-size neighbourhood,…