The following pages link to (Q4894611):
Displayed 50 items.
- Coupling from the past with randomized quasi-Monte Carlo (Q622169) (← links)
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution (Q623726) (← links)
- A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data (Q635417) (← links)
- The mathematics of mixing things up (Q644914) (← links)
- Incorporating biological information into linear models: a Bayesian approach to the selection of pathways and genes (Q652363) (← links)
- A polynomial-time perfect sampler for the \(Q\)-Ising with a vertex-independent noise (Q652623) (← links)
- Perfect sampling on contingency tables with an application to SAGE data (Q665045) (← links)
- Coupling control variates for Markov chain Monte Carlo (Q732966) (← links)
- Biased random walk in a one-dimensional percolation model (Q734642) (← links)
- Dynamic models of animal movement with spatial point process interactions (Q736727) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Finitary codings for spatial mixing Markov random fields (Q784183) (← links)
- Efficient Markovian couplings: Examples and counterexamples (Q811755) (← links)
- Simulating the Dickman distribution (Q844881) (← links)
- Ancestral processes for non-neutral models of complex diseases (Q849470) (← links)
- One-dimensional infinite memory imitation models with noise (Q892406) (← links)
- Steady-state simulation of reflected Brownian motion and related stochastic networks (Q894805) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- Spatial Bayesian variable selection models on functional magnetic resonance imaging time-series data (Q899050) (← links)
- Exact simulation for discrete time spin systems and unilateral fields (Q937163) (← links)
- Perfect simulation of a class of stochastic hybrid systems with an application to peer to peer systems (Q939017) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- Approximate zero-one laws and sharpness of the percolation transition in a class of models including two-dimensional Ising percolation (Q948748) (← links)
- Perfect simulation of stationary equilibria (Q964569) (← links)
- Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions (Q964840) (← links)
- Exponential rates of convergence in the ergodic theorem: a constructive approach (Q970560) (← links)
- Realizable monotonicity for continuous-time Markov processes (Q981007) (← links)
- Perfect simulation for marked point processes (Q1010404) (← links)
- On the invariant distribution of a one-dimensional avalanche process (Q1011150) (← links)
- An interruptible algorithm for perfect sampling via Markov chains (Q1296621) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- Tile invariants: New horizons. (Q1401369) (← links)
- Slice sampling. (With discussions and rejoinder) (Q1412362) (← links)
- Computational issues for perfect simulation in spatial point patterns. (Q1421552) (← links)
- Perfect simulation from population genetic models with selection. (Q1427700) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- On the exact simulation of functionals of stationary Markov chains (Q1434430) (← links)
- On the existence and nonexistence of finitary codings for a class of random fields (Q1568296) (← links)
- Ribbon tile invariants from the signed area (Q1601417) (← links)
- Perfect sampling from independent Metropolis-Hastings chains (Q1611778) (← links)
- Use of SAMC for Bayesian analysis of statistical models with intractable normalizing constants (Q1621320) (← links)
- Approximate maximum likelihood estimation of the autologistic model (Q1623803) (← links)
- Sampling weighted perfect matchings on the square-octagon lattice (Q1675927) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model (Q1706299) (← links)
- Efficient MCMC for Gibbs random fields using pre-computation (Q1711571) (← links)
- Using TPA to count linear extensions (Q1757459) (← links)
- Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
- Coloring percolation clusters at random. (Q1766017) (← links)