Μαρκοβιανές αλυσίδες και ζευγάρωμα από το παρελθόν

Postgraduate Thesis uoadl:1318255 603 Read counter

Unit:
Τομέας Στατιστικής και Επιχειρησιακής Έρευνας
Library of the School of Science
Deposit date:
2012-08-31
Year:
2012
Author:
Γκιώνη Ελίνα
Supervisors info:
Χελιώτης Δημήτρης Επικ. Καθηγ.(Επιβλέπων), Οικονόμου Αντ. Αναπλ. Καθηγ., Μελιγκοτσίδου Λ. Λέκτορας
Original Title:
Μαρκοβιανές αλυσίδες και ζευγάρωμα από το παρελθόν
Languages:
Greek
Summary:
In 1996Jim ProppandDavid Wilsonproducedan algorithm thatsolvesthe problems of a
standardMCMCmethod.
This algorithmwas named"the Propp-Wilsonalgorithm" and it is anexact simulation
algorithm.
 Toimprove the functionality ofthe Propp-Wilsonfor simulatingMarkov chainswith
large state spaces,
 the ideaofsandwiching came up,which was not affectedby the size ofthechain's
state space.Anotherrecent modification
 of the algorithmbyWilson,addressesthe problemscaused by therepeated
useandstorageof the samerandom numbers
 forsimulatingthe chains.
Keywords:
Markov chains, Propp-Wilson algorithm, Sandwiching, Wilson's modification , Twin run
Index:
No
Number of index pages:
0
Contains images:
No
Number of references:
3
Number of pages:
45
File:
File access is restricted.

document.pdf
487 KB
File access is restricted.