Sparse sets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Sparse sets

Résumé

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.).

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
18-28.pdf (142.04 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00274010 , version 1 (17-04-2008)

Identifiants

  • HAL Id : hal-00274010 , version 1

Citer

Alexander Shen, Laurent Bienvenu, Andrei Romashchenko. Sparse sets. JAC 2008, Apr 2008, Uzès, France. pp.18-28. ⟨hal-00274010⟩
212 Consultations
285 Téléchargements

Partager

Gmail Facebook X LinkedIn More