Stationarity detection in the initial transient problem

From MaRDI portal
Publication:4876084

DOI10.1145/137926.137932zbMath0842.68106OpenAlexW2089897750MaRDI QIDQ4876084

Hermann Thorisson, Peter W. Glynn, Soren Asmussen

Publication date: 28 April 1996

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/tomacs/




Related Items

Hoeffding's inequality for uniformly ergodic Markov chainsOn time- and cycle-stationarityConvergence rates of attractive-repulsive MCMC algorithmsThe eigenvalues of the empirical transition matrix of a Markov chainOptimal linear Bernoulli factories for small mean problemsA Guide to Exact SimulationHow to couple from the past using a read-once source of randomnessMultiparameter Bernoulli factoriesBernoulli Factories for Flow-Based PolytopesExact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for \(\rho < c\)Combinatorial Bernoulli factoriesNearly Optimal Bernoulli Factories for Linear FunctionsBarker's algorithm for Bayesian inference with intractable likelihoodsExact sampling for intractable probability distributions via a Bernoulli factoryNonexistence of a class of variate generation schemes.Simulating the maximum of a random walkComplexity Questions in Non-Uniform Random Variate GenerationStationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based ApproximationsConstruction of a stationary regenerative processOn the rate of convergence to equilibrium for reflected Brownian motionAnalysis of the behavior of the transient period in non-terminating simulationsSimulating events of unknown probabilities via reverse time martingalesExact sampling for some multi-dimensional queueing models with renewal inputMCMC convergence diagnosis via multivariate bounds on log-concave densitiesThe Computational Complexity of Estimating MCMC Convergence TimeLearning from uniformly ergodic Markov chainsPerfect sampling of GI/GI/\(c\) queuesEfficient Simulation via CouplingUsing a Markov Chain to Construct a Tractable Approximation of an Intractable Probability DistributionExact estimation for Markov chain equilibrium expectationsAn interruptible algorithm for perfect sampling via Markov chainsStructural characterization of taboo-stationarity for general processes in two-sided time.Perfect sampling of a single-server queue with periodic Poisson arrivalsSome topics in regenerative steady-state simulationFrom the Bernoulli factory to a dice enterprise via perfect sampling of Markov chainsRare events in queueing systems -- A survey