Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
users:benhamou:index [2019/10/28 13:45]
benhamou [Enseignements]
users:benhamou:index [2019/10/28 13:46] (current)
benhamou [Publications et pré-publications]
Line 43: Line 43:
    * A. Ben-Hamou, [[http://​smai.emath.fr/​IMG/​pdf/​Matapli114.pdf|Temps de mélange de marches aléatoires sur des graphes aléatoires]],​ Matapli **114**, pages 57-76. SMAI, 2017.    * A. Ben-Hamou, [[http://​smai.emath.fr/​IMG/​pdf/​Matapli114.pdf|Temps de mélange de marches aléatoires sur des graphes aléatoires]],​ Matapli **114**, pages 57-76. SMAI, 2017.
    * A. Ben-Hamou et Y. Peres, [[https://​projecteuclid.org/​euclid.ecp/​1527300061|Cutoff for a stratified random walk on the hypercube]],​ Electronic Communications in Probability,​ Vol. **23**, No. 32, 1-10, 2018.    * A. Ben-Hamou et Y. Peres, [[https://​projecteuclid.org/​euclid.ecp/​1527300061|Cutoff for a stratified random walk on the hypercube]],​ Electronic Communications in Probability,​ Vol. **23**, No. 32, 1-10, 2018.
-   * A. Ben-Hamou, S. Boucheron et E. Gassiat, [[http://​arxiv.org/​abs/​1608.08367|Pattern coding meets censoring: (almost) adaptive coding on countable alphabets]],​ soumis. 
    * A. Ben-Hamou, Y. Peres et Justin Salez, [[https://​projecteuclid.org/​euclid.bjps/​1528444876|Weighted sampling without replacement]],​ Brazilian Journal of Probability and Statistics, Vol. **32**, No. 3, 657-669, 2018.    * A. Ben-Hamou, Y. Peres et Justin Salez, [[https://​projecteuclid.org/​euclid.bjps/​1528444876|Weighted sampling without replacement]],​ Brazilian Journal of Probability and Statistics, Vol. **32**, No. 3, 657-669, 2018.
    * A. Ben-Hamou et J. Salez, [[http://​projecteuclid.org/​euclid.aop/​1494835230|Cutoff for non-backtracking random walks on sparse random graphs]], Annals of Probability **45**(3):​1752–1770,​ 2017.    * A. Ben-Hamou et J. Salez, [[http://​projecteuclid.org/​euclid.aop/​1494835230|Cutoff for non-backtracking random walks on sparse random graphs]], Annals of Probability **45**(3):​1752–1770,​ 2017.
    * A. Ben-Hamou, S. Boucheron et M. Ohannessian,​ [[http://​projecteuclid.org/​euclid.bj/​1475001355|Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass]], Bernoulli **23**(1):​249-287,​ 2017.    * A. Ben-Hamou, S. Boucheron et M. Ohannessian,​ [[http://​projecteuclid.org/​euclid.bj/​1475001355|Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass]], Bernoulli **23**(1):​249-287,​ 2017.
 +   * A. Ben-Hamou, S. Boucheron et E. Gassiat, [[http://​arxiv.org/​abs/​1608.08367|Pattern coding meets censoring: (almost) adaptive coding on countable alphabets]],​ 2016.
 
users/benhamou/index.txt · Last modified: 2019/10/28 13:46 by benhamou
Recent changes RSS feed Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki