Phase transitions in sampling algorithms and the underlying random structures

SWAT, pp. 309-309, 2010.

Cited by: 0|Views2
EI

Abstract:

Sampling algorithms based on Markov chains arise in many areas of computing, engineering and science. The idea is to perform a random walk among the elements of a large state space so that samples chosen from the stationary distribution are useful for the application. In order to get reliable results, we require the chain to be rapidly mi...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments