### Skapa referens, olika format (klipp och klistra)

**Harvard**

Hammar, O. (2010) *Inference in a Partially Observed Percolation Process*. Göteborg : University of Gothenburg (Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University, nr: 2010:44).

** BibTeX **

@book{

Hammar2010,

author={Hammar, Oscar},

title={Inference in a Partially Observed Percolation Process},

abstract={In this licentiate thesis, inference in a partially oberved percolation process living on a graph, is considered.
Each edge of the graph is declared open with probability $\theta$ and closed with probability $1-\theta$ independently of the states of all other edges.
The inference problem is to draw inference about $\theta$ based on the information on whether or not particular pairs of vertices are connected by open paths.
Consistency results under certain conditions on the graph are given for both a Bayesian and a frequentist approach to the inference problem.
Moreover, a simulation study is presented which in addition to illustrating the consistency results, also indicates that the consistency results might hold for percolation processes on more general graphs.},

publisher={Institutionen för matematiska vetenskaper, Chalmers tekniska högskola,},

place={Göteborg},

year={2010},

series={Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University, no: 2010:44},

keywords={Percolation, Bayesian inference, frequentistic inference, consistency, Markov chain Monte Carlo, Monte Carlo Expectation Maximization},

note={61},

}

** RefWorks **

RT Dissertation/Thesis

SR Print

ID 137154

A1 Hammar, Oscar

T1 Inference in a Partially Observed Percolation Process

YR 2010

AB In this licentiate thesis, inference in a partially oberved percolation process living on a graph, is considered.
Each edge of the graph is declared open with probability $\theta$ and closed with probability $1-\theta$ independently of the states of all other edges.
The inference problem is to draw inference about $\theta$ based on the information on whether or not particular pairs of vertices are connected by open paths.
Consistency results under certain conditions on the graph are given for both a Bayesian and a frequentist approach to the inference problem.
Moreover, a simulation study is presented which in addition to illustrating the consistency results, also indicates that the consistency results might hold for percolation processes on more general graphs.

PB Institutionen för matematiska vetenskaper, Chalmers tekniska högskola,

T3 Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University, no: 2010:44

LA eng

OL 30