# Computable error bounds for approximations i probability and statistics

*Statistical Mechanics/Combinatorics Seminar*

*by Professor Vladimir Ulyanov*

*Institution:*Moscow State University

*Date: Mon 4th August 2008*

*Time: 2:15 PM*

*Location: Architecture Room 103, Floor 1, The University of Melbourne*

*Abstract*: * Monday 4 Aug, 2:15-4:15pm

ARCHITECTURE Rm:103-Flr:1

* Thursday 7 Aug, 3:15-5:15pm

ALICE HOY-Rm:225-Flr:2

* Monday 11 Aug, 2:15-4:15pm

ARCHITECTURE-Rm:103-Flr:1

*

The lectures focus on a classical but still very popular subject: the accuracy of approximations in probability and statistics. The famous Berry-Esseen bounds are the most well-known results of this type. At the

same time, there are very few results when the accuracy of approximation

is given in explicit form, i.e. in the form of upper bounds for the

approximation errors where all the components of the bounds are known. The

accuracy of approximations in statistics is usually given in the form of the order of magnitude of the remainder term.

*For More Information:* Contact: Konstantin Borovkov K.Borovkov@ms.unimelb.edu.au