Book chapter 1300 views
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used
Markov Process and Controlled Markov Chains
Swansea University Author:
Yuzhi Cai
Abstract
In this paper we describe recent empirical work using perfect simulation toinvestigate how rates of convergence for Gibbs fields might depend onthe interaction between sites andthe kind of scanning used. We also give some experiment results onKendall's (1998) perfect simulation method for area-...
Published in: | Markov Process and Controlled Markov Chains |
---|---|
Published: |
2002
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa15301 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2013-12-05T10:57:15Z |
---|---|
last_indexed |
2018-02-09T04:47:09Z |
id |
cronfa15301 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2013-12-04T13:27:38.0157827</datestamp><bib-version>v2</bib-version><id>15301</id><entry>2013-07-30</entry><title>How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used</title><swanseaauthors><author><sid>eff7b8626ab4cc6428eef52516fda7d6</sid><ORCID>0000-0003-3509-9787</ORCID><firstname>Yuzhi</firstname><surname>Cai</surname><name>Yuzhi Cai</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2013-07-30</date><deptcode>BAF</deptcode><abstract>In this paper we describe recent empirical work using perfect simulation toinvestigate how rates of convergence for Gibbs fields might depend onthe interaction between sites andthe kind of scanning used. We also give some experiment results onKendall's (1998) perfect simulation method for area-interactionprocess, which show that the repulsive case could be quicker orslower than the attractive case for different choices ofthe parameters.</abstract><type>Book chapter</type><journal>Markov Process and Controlled Markov Chains</journal><paginationEnd>498</paginationEnd><publisher/><issnPrint/><issnElectronic/><keywords>McMC, Gibbs sampler, Perfect simulation, coalescence time, attractive, repulsive, area-interaction</keywords><publishedDay>30</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2002</publishedYear><publishedDate>2002-06-30</publishedDate><doi/><url/><notes/><college>COLLEGE NANME</college><department>Accounting and Finance</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>BAF</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2013-12-04T13:27:38.0157827</lastEdited><Created>2013-07-30T11:25:33.2350471</Created><path><level id="1">Faculty of Humanities and Social Sciences</level><level id="2">School of Management - Accounting and Finance</level></path><authors><author><firstname>Yuzhi</firstname><surname>Cai</surname><orcid>0000-0003-3509-9787</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2013-12-04T13:27:38.0157827 v2 15301 2013-07-30 How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used eff7b8626ab4cc6428eef52516fda7d6 0000-0003-3509-9787 Yuzhi Cai Yuzhi Cai true false 2013-07-30 BAF In this paper we describe recent empirical work using perfect simulation toinvestigate how rates of convergence for Gibbs fields might depend onthe interaction between sites andthe kind of scanning used. We also give some experiment results onKendall's (1998) perfect simulation method for area-interactionprocess, which show that the repulsive case could be quicker orslower than the attractive case for different choices ofthe parameters. Book chapter Markov Process and Controlled Markov Chains 498 McMC, Gibbs sampler, Perfect simulation, coalescence time, attractive, repulsive, area-interaction 30 6 2002 2002-06-30 COLLEGE NANME Accounting and Finance COLLEGE CODE BAF Swansea University 2013-12-04T13:27:38.0157827 2013-07-30T11:25:33.2350471 Faculty of Humanities and Social Sciences School of Management - Accounting and Finance Yuzhi Cai 0000-0003-3509-9787 1 |
title |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used |
spellingShingle |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used Yuzhi Cai |
title_short |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used |
title_full |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used |
title_fullStr |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used |
title_full_unstemmed |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used |
title_sort |
How rates of convergence for gibbs fields depend on the interaction and the kind of scanning used |
author_id_str_mv |
eff7b8626ab4cc6428eef52516fda7d6 |
author_id_fullname_str_mv |
eff7b8626ab4cc6428eef52516fda7d6_***_Yuzhi Cai |
author |
Yuzhi Cai |
author2 |
Yuzhi Cai |
format |
Book chapter |
container_title |
Markov Process and Controlled Markov Chains |
publishDate |
2002 |
institution |
Swansea University |
college_str |
Faculty of Humanities and Social Sciences |
hierarchytype |
|
hierarchy_top_id |
facultyofhumanitiesandsocialsciences |
hierarchy_top_title |
Faculty of Humanities and Social Sciences |
hierarchy_parent_id |
facultyofhumanitiesandsocialsciences |
hierarchy_parent_title |
Faculty of Humanities and Social Sciences |
department_str |
School of Management - Accounting and Finance{{{_:::_}}}Faculty of Humanities and Social Sciences{{{_:::_}}}School of Management - Accounting and Finance |
document_store_str |
0 |
active_str |
0 |
description |
In this paper we describe recent empirical work using perfect simulation toinvestigate how rates of convergence for Gibbs fields might depend onthe interaction between sites andthe kind of scanning used. We also give some experiment results onKendall's (1998) perfect simulation method for area-interactionprocess, which show that the repulsive case could be quicker orslower than the attractive case for different choices ofthe parameters. |
published_date |
2002-06-30T03:17:26Z |
_version_ |
1763750388900560896 |
score |
11.0241995 |