 |
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
 |
|
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
|
| HAL: hal-00274010, version 1 |
| Detailed view |  Export this paper |
 |
| JAC 2008, Uzès : France (2008) |
|
|
|
|
| Sparse sets |
|
|
Alexander Shen 1Laurent Bienvenu 1 |
|
|
| (2008-04-10) |
|
|
|
| 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.). |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
| 2: | Laboratoire de l'Informatique du Parallélisme (LIP) |
|
|
|
Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Other |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00274010, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00274010 | |
| oai:hal.archives-ouvertes.fr:hal-00274010 | |
| From: Bruno Durand | |
| Submitted on: Thursday, 17 April 2008 01:40:47 | |
| Updated on: Friday, 18 April 2008 20:57:50 | |
