Random sampling of lattice configurations using local Markov chains
Algorithms based on Markov chains are ubiquitous across scientific disciplines, as they provide a method for extracting statistical information about large, complicated systems. Although these algorithms may be applied to arbitrary graphs, many physical applications are more naturally studied under...
Main Author: | Greenberg, Sam |
---|---|
Published: |
Georgia Institute of Technology
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1853/28090 |
Similar Items
-
Learnable Markov Chain Monte Carlo Sampling Methods for Lattice Gaussian Distribution
by: Zheng Wang, et al.
Published: (2019-01-01) -
Markov Operators on Banach Lattices
by: Hawke, Peter
Published: (2007) -
Paths, sampling, and markov chain decomposition
by: Martin, Russell Andrew
Published: (2009) -
Perfect Sampling of Vervaat Perpetuities
by: Williams, Robert Tristan
Published: (2013) -
Can students' progress data be modeled using Markov chains?
by: Carlsson, Filip
Published: (2019)