Pages that link to "Item:Q4876084"
From MaRDI portal
The following pages link to Stationarity detection in the initial transient problem (Q4876084):
Displayed 36 items.
- Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for \(\rho < c\) (Q430004) (← links)
- Learning from uniformly ergodic Markov chains (Q1023402) (← links)
- Construction of a stationary regenerative process (Q1194596) (← links)
- An interruptible algorithm for perfect sampling via Markov chains (Q1296621) (← links)
- Some topics in regenerative steady-state simulation (Q1323529) (← links)
- Rare events in queueing systems -- A survey (Q1324094) (← links)
- On time- and cycle-stationarity (Q1346155) (← links)
- Nonexistence of a class of variate generation schemes. (Q1413896) (← links)
- Hoeffding's inequality for uniformly ergodic Markov chains (Q1612983) (← links)
- Barker's algorithm for Bayesian inference with intractable likelihoods (Q1705544) (← links)
- MCMC convergence diagnosis via multivariate bounds on log-concave densities (Q1807067) (← links)
- Exact sampling for intractable probability distributions via a Bernoulli factory (Q1950803) (← links)
- Simulating the maximum of a random walk (Q1973290) (← links)
- On the rate of convergence to equilibrium for reflected Brownian motion (Q1992149) (← links)
- From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains (Q2117444) (← links)
- Convergence rates of attractive-repulsive MCMC algorithms (Q2157419) (← links)
- Perfect sampling of GI/GI/\(c\) queues (Q2315061) (← links)
- Perfect sampling of a single-server queue with periodic Poisson arrivals (Q2352991) (← links)
- Optimal linear Bernoulli factories for small mean problems (Q2397969) (← links)
- Analysis of the behavior of the transient period in non-terminating simulations (Q2491791) (← links)
- Structural characterization of taboo-stationarity for general processes in two-sided time. (Q2574531) (← links)
- Combinatorial Bernoulli factories (Q2692531) (← links)
- The Computational Complexity of Estimating MCMC Convergence Time (Q3088115) (← links)
- Complexity Questions in Non-Uniform Random Variate Generation (Q3298440) (← links)
- Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution (Q3411057) (← links)
- The eigenvalues of the empirical transition matrix of a Markov chain (Q4822472) (← links)
- A Guide to Exact Simulation (Q4831988) (← links)
- How to couple from the past using a read-once source of randomness (Q4943355) (← links)
- Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations (Q5150207) (← links)
- Simulating events of unknown probabilities via reverse time martingales (Q5198664) (← links)
- Exact sampling for some multi-dimensional queueing models with renewal input (Q5203979) (← links)
- Exact estimation for Markov chain equilibrium expectations (Q5245637) (← links)
- Nearly Optimal Bernoulli Factories for Linear Functions (Q5366912) (← links)
- Efficient Simulation via Coupling (Q5485361) (← links)
- Multiparameter Bernoulli factories (Q6187484) (← links)
- Bernoulli Factories for Flow-Based Polytopes (Q6202751) (← links)