Littérature
389
Tav04.
S. Tavaré – « Ancestral inference in population genetics », Lectures
on probability theory and statistics, Lecture Notes in Math., vol. 1837,
Springer, Berlin, 2004, p. 1–188. 170, 183, 197
Tou99.
P. Toulouse – Thèmes de probabilités et statistique, Dunod, 1999.
373
TPH86.
J. N. Tsitsiklis, C. H. Papadimitriou et P. Humblet – « The performance of a precedence-based queueing discipline », J. Assoc. Comput. Mach. 33 (1986), no. 3, p. 593–602. 301
TT90.
D. Talay et L. Tubaro – « Expansion of the global error for numerical schemes solving stochastic differential equations », Stochastic Anal.
Appl. 8 (1990), no. 4, p. 483–509 (1991). 372
TVW10.
A. Tripathi, S. Venugopalan et D. B. West – « A short constructive proof of the Erdős-Gallai characterization of graphic lists », Discrete Math. 310 (2010), no. 4, p. 843–844. 67
vdH14.
R. van der Hofstad – « Random Graphs and Complex Networks »,
Lecture notes available on Internet, 2014. 67, 213, 227
Vil03.
C. Villani – Topics in optimal transportation, Graduate Studies in
Mathematics, vol. 58, American Mathematical Society, Providence, RI,
2003. 241
Vil06.
— , « Hypocoercive diffusion operators », International Congress of
Mathematicians. Vol. III, Eur. Math. Soc., Zürich, 2006, p. 473–498.
354
Vil08.
— , « H-theorem and beyond : Boltzmann’s entropy in today’s mathematics », Boltzmann’s legacy, ESI Lect. Math. Phys., Eur. Math. Soc.,
Zürich, 2008, p. 129–143. 355
Vil09.
— , « Hypocoercivity », Mem. Amer. Math. Soc. 202 (2009), no. 950,
p. iv+141. 354
Wil91.
D. Williams – Probability with martingales, Cambridge Mathematical
Textbooks, Cambridge University Press, Cambridge, 1991. 102, 373
Wil96.
D. B. Wilson – « Generating random spanning trees more quickly
than the cover time », In Proceedings of the 28’th annual ACM symposium on Theory of computing pages 296–303, 1996. 68
WL01.
F. Wang et D. P. Landau – « Efficient, Multiple-Range Random
Walk Algorithm to Calculate the Density of States », Physical Review
Letters 86 (2001), p. 2050. 81
Yca02.
B. Ycart – Modèles et algorithmes markoviens, Mathématiques &
Applications (Berlin) [Mathematics & Applications], vol. 39, SpringerVerlag, Berlin, 2002. 323
Yuk98.
J. E. Yukich – Probability theory of classical Euclidean optimization
problems, Lecture Notes in Mathematics, vol. 1675, Springer-Verlag,
Berlin, 1998. 275
389
Tav04.
S. Tavaré – « Ancestral inference in population genetics », Lectures
on probability theory and statistics, Lecture Notes in Math., vol. 1837,
Springer, Berlin, 2004, p. 1–188. 170, 183, 197
Tou99.
P. Toulouse – Thèmes de probabilités et statistique, Dunod, 1999.
373
TPH86.
J. N. Tsitsiklis, C. H. Papadimitriou et P. Humblet – « The performance of a precedence-based queueing discipline », J. Assoc. Comput. Mach. 33 (1986), no. 3, p. 593–602. 301
TT90.
D. Talay et L. Tubaro – « Expansion of the global error for numerical schemes solving stochastic differential equations », Stochastic Anal.
Appl. 8 (1990), no. 4, p. 483–509 (1991). 372
TVW10.
A. Tripathi, S. Venugopalan et D. B. West – « A short constructive proof of the Erdős-Gallai characterization of graphic lists », Discrete Math. 310 (2010), no. 4, p. 843–844. 67
vdH14.
R. van der Hofstad – « Random Graphs and Complex Networks »,
Lecture notes available on Internet, 2014. 67, 213, 227
Vil03.
C. Villani – Topics in optimal transportation, Graduate Studies in
Mathematics, vol. 58, American Mathematical Society, Providence, RI,
2003. 241
Vil06.
— , « Hypocoercive diffusion operators », International Congress of
Mathematicians. Vol. III, Eur. Math. Soc., Zürich, 2006, p. 473–498.
354
Vil08.
— , « H-theorem and beyond : Boltzmann’s entropy in today’s mathematics », Boltzmann’s legacy, ESI Lect. Math. Phys., Eur. Math. Soc.,
Zürich, 2008, p. 129–143. 355
Vil09.
— , « Hypocoercivity », Mem. Amer. Math. Soc. 202 (2009), no. 950,
p. iv+141. 354
Wil91.
D. Williams – Probability with martingales, Cambridge Mathematical
Textbooks, Cambridge University Press, Cambridge, 1991. 102, 373
Wil96.
D. B. Wilson – « Generating random spanning trees more quickly
than the cover time », In Proceedings of the 28’th annual ACM symposium on Theory of computing pages 296–303, 1996. 68
WL01.
F. Wang et D. P. Landau – « Efficient, Multiple-Range Random
Walk Algorithm to Calculate the Density of States », Physical Review
Letters 86 (2001), p. 2050. 81
Yca02.
B. Ycart – Modèles et algorithmes markoviens, Mathématiques &
Applications (Berlin) [Mathematics & Applications], vol. 39, SpringerVerlag, Berlin, 2002. 323
Yuk98.
J. E. Yukich – Probability theory of classical Euclidean optimization
problems, Lecture Notes in Mathematics, vol. 1675, Springer-Verlag,
Berlin, 1998. 275