(A) proof of law of the iterated logarithm by using Wang's maximal inequalityWang의 극대 부등식을 이용한 반복된 로그 법칙의 증명
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Choi, Chang-Sun | - |
| dc.contributor.advisor | 최창선 | - |
| dc.contributor.author | Kim, Hwa-Sung | - |
| dc.contributor.author | 김화성 | - |
| dc.date.accessioned | 2011-12-14T04:53:03Z | - |
| dc.date.available | 2011-12-14T04:53:03Z | - |
| dc.date.issued | 1998 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=135380&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/41972 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수학과, 1998.2, [ 14 p. ; ] | - |
| dc.description.abstract | Wang(1996) studied variations of Kolmogorov``s inequalily. He derived a sequence of maximal inequalities which sharpen Hoeffding``s inquality. In this thesis, we study the law of the iterated logarithm(LIL) in case the random variables have independent, identical standard normal distribution. In proving the above case, Doob``s submartingale inequality is usually employed to obtain the upper bound of LIL. Here we use Wang``s result to obtain the upper bound of LIL and prove LIL without Doob``s submartingale inequality. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | Maximal inequality | - |
| dc.subject | Law of the iterated logarithm | - |
| dc.subject | 반복된 로그 법칙 | - |
| dc.subject | 극대 부등식 | - |
| dc.title | (A) proof of law of the iterated logarithm by using Wang's maximal inequality | - |
| dc.title.alternative | Wang의 극대 부등식을 이용한 반복된 로그 법칙의 증명 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 135380/325007 | - |
| dc.description.department | 한국과학기술원 : 수학과, | - |
| dc.identifier.uid | 000963189 | - |
| dc.contributor.localauthor | Choi, Chang-Sun | - |
| dc.contributor.localauthor | 최창선 | - |
- Appears in Collection
- MA-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.