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].”
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Catalytic Perfect Simulation. https://app.cochat.ai/papers/10.1023/a:1012205210377
- The paper
- Breyer, L. A., & Roberts, G. O. (2001). Catalytic Perfect Simulation. Methodology And Computing In Applied Probability. https://doi.org/10.1023/a%3A1012205210377
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.