Estimation in exponential families with unknown normalizing constant

Placeholder Show Content

Abstract/Contents

Abstract
Exponential families of probability measures has been a subject of considerable interest in Statistics, both in theoretical and applied areas. One of the problems that frequently arise in such models is that the normalizing constant is not known in closed form. Also numerical computation of the normalizing constant is infeasible because the size of the underlying space is huge. As such, carrying out inferential procedures becomes challenging. In this thesis, the main object of study is some specific examples of exponential families on graphs and permutations, where the normalizing constant is hard to compute. Using large deviation results asymptotic estimates of the normalizing constant is obtained, and methods to estimate the normalizing constant are developed. In the case of graphs, this analysis gives some insight into the phenomenon of "degeneracy" observed in empirical studies in social science literature. In the case of permutations, this analysis is used to show the consistency of pseudo-likelihood.

Description

Type of resource text
Form electronic; electronic resource; remote
Extent 1 online resource.
Publication date 2014
Issuance monographic
Language English

Creators/Contributors

Associated with Mukherjee, Sumit
Associated with Stanford University, Department of Statistics.
Primary advisor Diaconis, Persi
Thesis advisor Diaconis, Persi
Thesis advisor Chatterjee, Sourav
Thesis advisor Dembo, Amir
Advisor Chatterjee, Sourav
Advisor Dembo, Amir

Subjects

Genre Theses

Bibliographic information

Statement of responsibility Sumit Mukherjee.
Note Submitted to the Department of Statistics.
Thesis Thesis (Ph.D.)--Stanford University, 2014.
Location electronic resource

Access conditions

Copyright
© 2014 by Sumit Mukherjee
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Also listed in

Loading usage metrics...