Catalytic Perfect Simulation
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The end-point of a random walk that starts from a random page and can be terminated at each step with probability 1 -c , appears to be a sample from the distribution π [4, 7, 9].”
From Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient (2007) · cites this paper as [4]
Citations
Cites
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606 · cited 4×
“This model has been considered by various authors (Gelfand and Smith, 1990; Reutter and Johnson, 1995; Murdoch and Green, 1998).”
BackgroundMethodInfluentialMarkov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods
Smith, A. F. M., & Roberts, G. O. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01466.x · Cited by 1,713
Self-citationExact sampling with coupled Markov chains and applications to statistical mechanics
Propp, J. G., & Wilson, D. B. (1996) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.0.co;2-o · Cited by 1,159
Exact Sampling from a Continuous State Space
Murdoch, D. J., & Green, P. J. (1998) · Scandinavian Journal of Statistics · doi:10.1111/1467-9469.00116 · Cited by 162 · cited 2×
“This model has been considered by various authors (Gelfand and Smith, 1990; Reutter and Johnson, 1995; Murdoch and Green, 1998).”
MethodHow to couple from the past using a read-once source of randomness
Wilson, D. B. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200001)16:1<85::aid-rsa6>3.0.co;2-h · Cited by 100
On perfect simulation for some mixtures of distributions
Hobert, J. P., Robert, C. P., & Titterington, D. M. (1999) · Statistics and Computing · doi:10.1023/a:1008912006771 · Cited by 26 · cited 7×
“,Ψn ∼ U [0, 1] and χij ∼ exp(1), in which case the acceptance ratio in (3) simplifies immediately to π0(U1, .”
BackgroundMethodInfluentialExact sampling for Bayesian inference: Unbounded state spaces
Murdoch, D. (2000) · doi:10.1090/fic/026/08 · Cited by 6 · cited 4×
“Our methodology builds on a number of ideas previously introduced by Breyer and Roberts (1999), by Murdoch (1999), and by Wilson (1999).”
BackgroundMethodInfluential
Cited by
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
Avrachenkov, K., Litvak, N., Nemirovsky, D., & Osipova, N. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050643799 · Cited by 250
“The end-point of a random walk that starts from a random page and can be terminated at each step with probability 1 − c, appears to be a sample from the distribution π [4, 7, 9].”
BackgroundA mixture representation of π with applications in Markov chain Monte Carlo and perfect sampling
Hobert, J. P., & Robert, C. P. (2004) · The Annals of Applied Probability · doi:10.1214/105051604000000305 · Cited by 34
“Theorem 2 of Breyer and Roberts (2001) shows that ∑ ∞ j=1ω(1−ω) j−1Kj−1(µ, ·) is an invariant probability measure for M .”
MethodA Regeneration Proof of the Central Limit Theorem for Uniformly Ergodic Markov Chains
Bednorz, W. M., Łatuszyński, K., & Latała, R. (2008) · Electronic Communications in Probability · doi:10.1214/ecp.v13-1354 · Cited by 23
“in [14], [7] and [ 3 ] and are closely related to perfect sampling algorithms, such as coupling form the past (CFTP) introduced in [15].”
BackgroundPerfect Forward Simulation via Simulated Tempering
Brooks, S. P., Fan, Y., & Rosenthal, J. S. (2006) · Communications in Statistics - Simulation and Computation · doi:10.1080/03610910600716753 · Cited by 22
“This idea was first suggested by Murdoch and Green (1998) in the context of chains whose transition distributions are completely known and subsequently extended by Wilson (2000) and Breyer and Roberts (2000).”
BackgroundKendall, W. S. (2005) · Lecture notes series, Institute For Mathematical Sciences · doi:10.1142/9789812700919_0003 · Cited by 21
“(See [6, 11, 43].”
Direct simulation for discrete mixture distributions
Fearnhead, P. (2005) · Statistics and Computing · doi:10.1007/s11222-005-6204-7 · Cited by 16
Hobert, J. P., Jones, G. L., & Robert, C. P. (2006) · Scandinavian Journal of Statistics · doi:10.1111/j.1467-9469.2006.00467.x · Cited by 14
“Key words: burn-in, Gibbs sampler, minorization condition, mixture representation, Monte Carlo, regeneration, split chain”
BackgroundMethodOne-Shot CFTP; Application to a Class of Truncated Gaussian Densities
Beskos, A., & Roberts, G. O. (2005) · Methodology And Computing In Applied Probability · doi:10.1007/s11009-005-5001-2 · Cited by 8
“Independence Couplers can be constructed in a natural way for general Metropolis-Hastings kernels (see Breyer and Roberts, 2001).”
BackgroundMethodInfluentialSelf-citationNonasymptotic Bounds on the Mean Square Error for MCMC Estimates via Renewal Techniques
Łatuszyński, K., Miasojedow, B., & Niemiro, W. (2012) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-642-27440-4_31 · Cited by 7
“be performed easily as a version of read-once algorithm [35]. This is due to the following observation. If condition (22) holds and X0 ∼νthen XT k−1, k =1,2,... are i.i.d. random variables from π(see [5, 28, 14, 4] for versions of this result). Therefore from each random tour between regeneration times one can obtain…”
BackgroundSmall sets and Markov transition densities
Kendall, W. S., & Montana, G. (2002) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(02)00090-x · Cited by 7
“…Ney [1] where small sets are used for regeneration arguments – and hence to control convergence to equilibrium: as Nummelin wrote, “the ‘elementary’ techniques and constructions based on the notion of regeneration, and common in the study of discrete chains, can now be applied in the general case”…”
BackgroundA new rejection sampling method without using hat function
Dai, H. (2017) · Bernoulli · doi:10.3150/16-bej814 · Cited by 4
“such as [4,8,15,16,20,24,28] and [9], the CFTP algorithm is still not practical for complex statistical models.”
MethodSome Notes on Topological Recurrence
Carlsson, N. (2005) · Electronic Communications in Probability · doi:10.1214/ecp.v10-1137 · Cited by 3
“For our proof, we will need the following general Lemma that can be found in the Appendix of [4].”
BackgroundMethodMonte Carlo methods of PageRank computation
Litvak, N. (2004) · University of Twente Research Information · Cited by 3
Perfect Simulation for Image Restoration
Huber, M. (2007) · Stochastic Models · doi:10.1080/15326340701471117 · Cited by 3
“When a result similar to (5) is possible for monotonic chain, it is possible to obtain a multishift coupler applicable in more situations than the one employed by Wilson [ 17 ] by combining the catalytic coupling idea of Breyer and Roberts [ 3 ] with a small nonmonotonic Metropolis chain move.”
MethodPerfect posterior simulation for mixture and hidden Markov models
Berthelsen, K. K., Breyer, L. A., & Roberts, G. O. (2010) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157007000022 · Cited by 2
“For a proof based on the ideas of Propp and Wilson’s coupling from the past algorithm, see [9]; for a more algebraic proof, see [3].”
BackgroundSelf-citationLee, D. S. (2009) · IGI Global eBooks · doi:10.4018/978-1-59904-982-3.ch010 · Cited by 2
A Load Balancing Strategy for Monte Carlo Method in PageRank Problem
Shao, B., Lai, S., Yang, B., Xu, Y., & Lin, X. (2017) · Communications in computer and information science · doi:10.1007/978-981-10-6442-5_56 · Cited by 1
Monotonic multigamma coupling for perfect sampling
Mitha, F., & Huber, M. (2011) · Journal of Statistical Computation and Simulation · doi:10.1080/00949655.2010.548065
“The coupler of Breyer and Roberts [5] operates by utilizing an independence sampler to move from a continuous range of states to a single state in one move.”
Obituary: Richard Lewis Tweedie
Dunsmuir, W. T. M., Meyn, S., & Roberts, G. O. (2002) · Journal of Applied Probability · doi:10.1239/jap/1025131442
“It also leads to a powerful and general method for constructing perfect simulation algorithms [161].”
MethodSelf-citationExact Markov chain Monte Carlo and Bayesian linear regression
Bentley, J. (2009) · UC Research Repository (University of Canterbury) · doi:10.26021/5738
OBITUARY: Richard Lewis Tweedie
Tweedie, R. L. (2002)
Mazalov, V. V., & Chirkova, J. V. (2019) · Elsevier eBooks · doi:10.1016/b978-0-12-816551-5.00012-5
Regeneration and Fixed-Width Analysis of Markov Chain Monte Carlo Algorithms
Łatuszyński, K., & Niemiro, W. (2008)
Obituary: Richard Lewis Tweedie
Dunsmuir, W. T. M., Meyn, S., & Roberts, G. O. (2002) · Journal of Applied Probability · doi:10.1017/s0021900200022671
Self-citation(2019) · Elsevier eBooks · doi:10.1016/b978-0-12-816551-5.00018-6
Metadata
- Authors
- Breyer, L. A., & Roberts, G. O.
- Affiliations
- Lancaster University (GB)
- ORCID
- Roberts, G. O.
- Venue
- Methodology And Computing In Applied Probability
- Published
- 2001-06
- Volume
- 3
- Issue
- 2
- Pages
- 161-177
- ISSN
- 1387-5841 (ISSN-L)
- 1573-7713
- OpenAlex
- W2046379078
- Cited by
- 25
- References
- 8
- Citations by year
- 2019: 2 · 2017: 2 · 2012: 1
- FWCI
- 2.63
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Methodology And Computing In Applied Probability (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- European Commission
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- Social Sciences › Decision Sciences › Management Science and Operations Research › Simulation Techniques and Applications
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Bayesian Inference
- Keywords
- perfect simulation, catalysts, random fields, Markov chain Monte Carlo, Bayesian posterior distribution, Gibbs sampling, Markov random fields
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.