Pages that link to "Item:Q1304023"

The following pages link to Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes (Q1304023):

Displaying 23 items.

• Spatial birth-death swap chains (Q442088) (← links)
• Perfect simulation for marked point processes (Q1010404) (← links)
• The analysis of marked point patterns evolving through space and time (Q1010520) (← links)
• An interruptible algorithm for perfect sampling via Markov chains (Q1296621) (← links)
• Perfect sampling from independent Metropolis-Hastings chains (Q1611778) (← links)
• Mixture formulae for shot noise weighted point processes (Q1827548) (← links)
• Perfect sampling of ergodic Harris chains (Q1872460) (← links)
• Perfect sampling for Bayesian variable selection in a linear regression model (Q1888858) (← links)
• Sharp phase transition for the continuum Widom-Rowlinson model (Q2041801) (← links)
• Strong spatial mixing for repulsive point processes (Q2165287) (← links)
• Doeblin trees (Q2279314) (← links)
• Perfect simulation for interacting point processes, loss networks and Ising models. (Q2574519) (← links)
• PERFECT STOCHASTIC SUMMATION IN HIGH ORDER FEYNMAN GRAPH EXPANSIONS (Q3427086) (← links)
• Power diagrams and interaction processes for unions of discs (Q3516392) (← links)
• Nonparametric indices of dependence between components for inhomogeneous multivariate random measures and marked sets (Q4646960) (← links)
• A Guide to Exact Simulation (Q4831988) (← links)
• Likelihood Inference for Gibbs Processes in the Analysis of Spatial Point Patterns (Q4831991) (← links)
• How to couple from the past using a read-once source of randomness (Q4943355) (← links)
• The continuum Potts model at the disorder–order transition—a study by cluster dynamics (Q4968860) (← links)
• Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models (Q5156805) (← links)
• Nearest-neighbour Markov point processes on graphs with Euclidean edges (Q5215044) (← links)
• Pseudo-perfect and adaptive variants of the Metropolis–Hastings algorithm with an independent candidate density (Q5460693) (← links)
• Quasipolynomial-time algorithms for Gibbs point processes (Q6632789) (← links)