東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The Method of Dense Cycle Conditioni...

Banerjee, Debapratim.

Linked to FindBook

Google Book

Amazon

博客來

The Method of Dense Cycle Conditioning, Its Application, Computation and a Result on Concentration.

Record Type:	Electronic resources : Monograph/item
Title/Author:	The Method of Dense Cycle Conditioning, Its Application, Computation and a Result on Concentration./
Author:	Banerjee, Debapratim.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2019,
Description:	283 p.
Notes:	Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Contained By:	Dissertations Abstracts International81-04B.
Subject:	Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=22589527
ISBN:	9781088373347

The Method of Dense Cycle Conditioning, Its Application, Computation and a Result on Concentration.
Banerjee, Debapratim.

The Method of Dense Cycle Conditioning, Its Application, Computation and a Result on Concentration. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 283 p.

Source: Dissertations Abstracts International, Volume: 81-04, Section: B.

Thesis (Ph.D.)--University of Pennsylvania, 2019.

This item must not be sold to any third party vendors.

This dissertation contains works on three different directions. In the first direction, three different problems have been solved. The fundamental theme of these problems are to consider the log-likelihood ratio of certain processes under local perturbations. It is shown that in these cases below certain threshold the log-likelihood ratio can be approximated by log-likelihood ratio restricted to a certain class of statistics called the ``signed cycles". These statistics were considered by the author in order to study contiguity for planted partition model in dense case. Details are given in Chapter 2. The sparse case is known in the literature by a paper of Mossel et al. These statistics found further applications in statistics and statistical physics where two other problems were solved. One might look at Chapters 3 and 1 for details. The second direction of this thesis is to show computability of these cycle statistics. It is proved that the ``signed cycles" statistics can be approximated by certain linear spectral statistics of high dimensional random matrices. The proof techniques are highly motivated by a paper of Anderson and Zeitouni. One can have a look at Chapter 4 for details. In the third direction a problem of concentration inequality is considered. A Bernstein type concentration inequality is proved for statistics which are generalizations of a statistics introduced by Hoeffding. It is proven using the method exchangeable pairs introduced by Chatterjee. One might look at Chapter 6 for details.

ISBN: 9781088373347Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Dense cycle conditioning

The Method of Dense Cycle Conditioning, Its Application, Computation and a Result on Concentration.
LDR:02624nmm a2200337 4500 001 2272713
005 20201105110204.5
008 220629s2019 ||||||||||||||||| ||eng d
020 $a 9781088373347
035 $a (MiAaPQ)AAI22589527
035 $a AAI22589527
040 $a MiAaPQ $c MiAaPQ
100 1 $a Banerjee, Debapratim. $3 3550139
245 1 4 $a The Method of Dense Cycle Conditioning, Its Application, Computation and a Result on Concentration.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 283 p.
500 $a Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
500 $a Advisor: Ma, Zongming.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a This dissertation contains works on three different directions. In the first direction, three different problems have been solved. The fundamental theme of these problems are to consider the log-likelihood ratio of certain processes under local perturbations. It is shown that in these cases below certain threshold the log-likelihood ratio can be approximated by log-likelihood ratio restricted to a certain class of statistics called the ``signed cycles". These statistics were considered by the author in order to study contiguity for planted partition model in dense case. Details are given in Chapter 2. The sparse case is known in the literature by a paper of Mossel et al. These statistics found further applications in statistics and statistical physics where two other problems were solved. One might look at Chapters 3 and 1 for details. The second direction of this thesis is to show computability of these cycle statistics. It is proved that the ``signed cycles" statistics can be approximated by certain linear spectral statistics of high dimensional random matrices. The proof techniques are highly motivated by a paper of Anderson and Zeitouni. One can have a look at Chapter 4 for details. In the third direction a problem of concentration inequality is considered. A Bernstein type concentration inequality is proved for statistics which are generalizations of a statistics introduced by Hoeffding. It is proven using the method exchangeable pairs introduced by Chatterjee. One might look at Chapter 6 for details.
590 $a School code: 0175.
650 4 $a Mathematics. $3 515831
650 4 $a Statistics. $3 517247
650 4 $a Statistical physics. $3 536281
653 $a Dense cycle conditioning
653 $a Concentration
690 $a 0405
690 $a 0463
690 $a 0217
710 2 $a University of Pennsylvania. $b Statistics. $3 2092574
773 0 $t Dissertations Abstracts International $g 81-04B.
790 $a 0175
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=22589527