388
Littérature
Rud87.
W. Rudin – Real and complex analysis, third éd., McGraw-Hill Book
Co., New York, 1987. 323
Rug01.
C. Ruget (éd.) – Mathématiques en situation, SCOPOS, vol. 11,
Springer-Verlag, Berlin, 2001, Issues de l’épreuve de modélisation de
l’agrégation. [From the Examination in Modelling for the Agrégation].
54
RW00.
L. C. G. Rogers et D. Williams – Diffusions, Markov processes,
and martingales. Vol. 1, Cambridge Mathematical Library, Cambridge
University Press, Cambridge, 2000, Foundations, Reprint of the second
(1994) edition. 374
RY99.
D. Revuz et M. Yor – Continuous martingales and Brownian motion,
third éd., Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 293, Springer-Verlag,
Berlin, 1999. 373
Ré85.
J.-L. Rémy – « Un procédé itératif de dénombrement d’arbres binaires
et son application à leur génération aléatoire », R.A.I.R.O. Informatique Théorique 19 (1985), no. 2, p. 179–195. 68
She07.
S. Sheffield – « Gaussian free fields for mathematicians », Probab.
Theory Related Fields 139 (2007), no. 3-4, p. 521–541. 37
Shi96.
A. N. Shiryaev – Probability, second éd., Graduate Texts in Mathematics, vol. 95, Springer-Verlag, New York, 1996, Translated from the
first (1980) Russian edition by R. P. Boas. 373
SM02.
J. Siltaneva et E. Mäkinen – « A comparison of random binary tree
generators », The Computer Journal 45 (2002), no. 6, p. 653–660. 68
Spi70.
F. Spitzer – Principes des cheminements aléatoires, Traduit de l’anglais par E. Baverez et J.-L. Guignard. Centre Interarmés de Recherche
Opérationnelle, vol. 2, Dunod, Paris, 1970. 37
Sta83.
A. J. Stam – « Generation of a random partition of a finite set by an
urn model », J. Combin. Theory Ser. A 35 (1983), no. 2, p. 231–240.
67
Ste94.
J. M. Steele – « Le Cam’s inequality and Poisson approximations »,
Amer. Math. Monthly 101 (1994), no. 1, p. 48–54. 15
Ste97.
— , Probability theory and combinatorial optimization, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 69, Society for
Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
15, 275
Tal96.
D. Talay – « Probabilistic numerical methods for partial differential
equations : elements of analysis », Probabilistic models for nonlinear
partial differential equations (Montecatini Terme, 1995), Lecture Notes
in Math., vol. 1627, Springer, Berlin, 1996, p. 148–196. 372
Tal02.
— , « Stochastic Hamiltonian systems : exponential convergence to the
invariant measure, and discretization by the implicit Euler scheme »,
Markov Process. Related Fields 8 (2002), no. 2, p. 163–198, Inhomogeneous random systems (Cergy-Pontoise, 2001). 354
Tar11.
P. Tarrès – « Localization of reinforced random walks »,
arXiv:1103.5536, 2011. 213
Littérature
Rud87.
W. Rudin – Real and complex analysis, third éd., McGraw-Hill Book
Co., New York, 1987. 323
Rug01.
C. Ruget (éd.) – Mathématiques en situation, SCOPOS, vol. 11,
Springer-Verlag, Berlin, 2001, Issues de l’épreuve de modélisation de
l’agrégation. [From the Examination in Modelling for the Agrégation].
54
RW00.
L. C. G. Rogers et D. Williams – Diffusions, Markov processes,
and martingales. Vol. 1, Cambridge Mathematical Library, Cambridge
University Press, Cambridge, 2000, Foundations, Reprint of the second
(1994) edition. 374
RY99.
D. Revuz et M. Yor – Continuous martingales and Brownian motion,
third éd., Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 293, Springer-Verlag,
Berlin, 1999. 373
Ré85.
J.-L. Rémy – « Un procédé itératif de dénombrement d’arbres binaires
et son application à leur génération aléatoire », R.A.I.R.O. Informatique Théorique 19 (1985), no. 2, p. 179–195. 68
She07.
S. Sheffield – « Gaussian free fields for mathematicians », Probab.
Theory Related Fields 139 (2007), no. 3-4, p. 521–541. 37
Shi96.
A. N. Shiryaev – Probability, second éd., Graduate Texts in Mathematics, vol. 95, Springer-Verlag, New York, 1996, Translated from the
first (1980) Russian edition by R. P. Boas. 373
SM02.
J. Siltaneva et E. Mäkinen – « A comparison of random binary tree
generators », The Computer Journal 45 (2002), no. 6, p. 653–660. 68
Spi70.
F. Spitzer – Principes des cheminements aléatoires, Traduit de l’anglais par E. Baverez et J.-L. Guignard. Centre Interarmés de Recherche
Opérationnelle, vol. 2, Dunod, Paris, 1970. 37
Sta83.
A. J. Stam – « Generation of a random partition of a finite set by an
urn model », J. Combin. Theory Ser. A 35 (1983), no. 2, p. 231–240.
67
Ste94.
J. M. Steele – « Le Cam’s inequality and Poisson approximations »,
Amer. Math. Monthly 101 (1994), no. 1, p. 48–54. 15
Ste97.
— , Probability theory and combinatorial optimization, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 69, Society for
Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
15, 275
Tal96.
D. Talay – « Probabilistic numerical methods for partial differential
equations : elements of analysis », Probabilistic models for nonlinear
partial differential equations (Montecatini Terme, 1995), Lecture Notes
in Math., vol. 1627, Springer, Berlin, 1996, p. 148–196. 372
Tal02.
— , « Stochastic Hamiltonian systems : exponential convergence to the
invariant measure, and discretization by the implicit Euler scheme »,
Markov Process. Related Fields 8 (2002), no. 2, p. 163–198, Inhomogeneous random systems (Cergy-Pontoise, 2001). 354
Tar11.
P. Tarrès – « Localization of reinforced random walks »,
arXiv:1103.5536, 2011. 213