Dai, Hongsheng (2008) Perfect Sampling Methods For Random Forests. Advances in Applied Probability, 40 (3). pp. 897-917. ISSN 1475-6064Full text not available from this repository.
A weighted graph G is a pair (V, E) containing vertex set V and edge set E, where each edge e ∈ E is associated with a weight We. A subgraph of G is a forest if it has no cycles. All forests on the graph G form a probability space, where the probability of each forest is proportional to the product of the weights of its edges. This paper aims to simulate forests exactly from the target distribution. Methods based on coupling from the past (CFTP) and rejection sampling are presented. Comparisons of these methods are given theoretically and via simulation.
|Journal or Publication Title:||Advances in Applied Probability|
|Uncontrolled Keywords:||Coupling from the past ; MCMC ; perfect sampling ; rejection sampling ; trees and forests.|
|Subjects:||Q Science > QA Mathematics|
|Departments:||Faculty of Science and Technology > Mathematics and Statistics|
|Deposited By:||Mr Hongsheng Dai|
|Deposited On:||05 Feb 2008 11:53|
|Last Modified:||25 Mar 2017 01:10|
Actions (login required)