Sparse sets

Alexander Shen (1) , Laurent Bienvenu (1) , Andrei Romashchenko (2)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166
2 LIP - Laboratoire de l'Informatique du Parallélisme

For a given p>0 we consider sequences that are random with respect to p-Bernoulli distribution and sequences that can be obtained from them by replacing ones by zeros. We call these sequences sparse and study their properties. They can be used in the robustness analysis for tilings or computations and in percolation theory. This talk is a report on an (unfinished) work and is based on the discussions with many people in Lyon and Marseille (B. Durand, P. Gacs, D. Regnault, G. Richard a.o.) and Moscow (at the Kolmogorov seminar: A. Minasyan, M. Raskin, A. Rumyantsev, N. Vereshchagin, D. Hirschfeldt a.o.).

Domains: Other [cs.OH]

Alexander Shen, Laurent Bienvenu, Andrei Romashchenko. Sparse sets. JAC 2008, Apr 2008, Uzès, France. pp.18-28. ⟨hal-00274010⟩