jump to search box

Monte Carlo methods for structured data [electronic resource] / Adam Guetz.

Availability

Online

At the Library

  • Special Collections - University Archives: request at Special Collections service desk
    Request at service desk
    1. 3781 2012 G must be paged/requested for in-library use only

Other libraries

Author/Creator:
Guetz, Adam Nathan.
Language:
English
Imprint:
2012.
Format:
  • Book, Thesis
  • 1 online resource.
Note:
Submitted to the Institute for Computational and Mathematical Engineering.
Note:
Thesis (Ph.D.)--Stanford University, 2012.
Summary:
Sequential importance sampling is well known to have difficulties in high-dimensional settings. I present a technique called conditional sampling-importance resampling, an extension of sampling importance resampling to conditional distributions that improves performance, particularly when independence structure is present. The primary application is to multi-object tracking for a colony of harvester ants in a laboratory setting. Previous approaches tend to make simplifying parametric assumptions on the model in order to make computations more tractable, while the approach presented finds approximate solutions to more complicated and realistic models. To analyze structural properties of networks, I expand adaptive importance sampling techniques to the analysis of network growth models such as preferential attachment, using the Plackett-Luce family of distributions on permutations, and I present an application of sequential Monte Carlo to a special form of network growth model called vertex censored stochastic Kronecker product graphs.
Contributor:
Holmes, Susan, primary advisor.
Saberi, Amin, primary advisor.
Glynn, Peter W., advisor.
Stanford University. Institute for Computational and Mathematical Engineering.

powered by Blacklight
© Stanford University. Stanford, California 94305. (650) 725-1064. Terms of Use | Copyright Complaints | Opt Out of Analytics
jump to top