# Djalil CHAFAÏ

Université Paris-Dauphine / PSL

Publications29

Citations573

Influential Citations63

- Publications
- Influence

- Cécile Ané, Sébastien Blachère, +5 authors Grégory Scheffer
- 2000

- Djalil CHAFAÏ
- 2006

This article provides entropic inequalities for binomial-Poisson distributions, derived from the two point space. They appear as local inequalities of the M/M/∞ queue. They describe in particular the… (More)

- Djalil CHAFAÏ
- 2004

Our aim is to provide a short and self contained synthesis which generalise and unify various related and unrelated works involving what we call Phi-Sobolev functional inequalities. Such inequalities… (More)

- Charles Bordenave, Djalil CHAFAÏ
- 2012

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the… (More)

Advanced infrared sounders will provide thousands of radiance data at every observation location. The number of individual pieces of information is not usable in an operational numerical… (More)

— These notes are an expanded version of short courses given at the occasion of a school held in Universite Paris-Est Marne-la-Vallee, 16–20 November 2009, by Djalil Chafai, Olivier Guedon, Guillaume… (More)

- Djalil CHAFAÏ
- 2002

Our aim is to provide a short and self contained synthesis which generalise and unify various related and unrelated works involving what we call Phi-Sobolev functional inequalities. Such inequalities… (More)

- Djalil CHAFAÏ, Florent Malrieu, Katy Paroux
- ArXiv
- 2010

The TCP window size process appears in the modeling of the famous transmission control protocol used for data transmission over the Internet. This continuous time Markov process takes its values in… (More)

Let (Xjk)jk≥1 be i.i.d. nonnegative random variables with bounded density, mean m, and finite positive variance σ2. Let M be the n × n random Markov matrix with i.i.d. rows defined by… (More)

- Charles Bordenave, Pietro Caputo, Djalil CHAFAÏ
- 2011

We consider the random reversible Markov kernel K obtained by assigning i.i.d. non negative weights to the edges of the complete graph over n vertices, and normalizing by the corresponding row sum.… (More)