Journal ArticleDOI
Applied Probability and Queues.
A. W. Kemp,Søren Asmussen +1 more
About:
This article is published in The Statistician.The article was published on 1988-01-01. It has received 793 citations till now. The article focuses on the topics: Applied probability.read more
Citations
More filters
Journal ArticleDOI
Asset Pricing with Heterogeneous Consumers
TL;DR: In this paper, a joint process of arbitrage-free asset prices, dividends, and aggregate income is shown to be supported in the equilibrium of an economy with judiciously modeled income heterogeneity.
Journal ArticleDOI
Lower bounds for covering times for reversible Markov chains and random walks on graphs
TL;DR: For simple random walk on aN-vertex graph, the mean time to cover all vertices is at leastcN log(N), wherec>0 is an absolute constant, deduced from a more general result about stationary finite-state reversible Markov chains.
Journal ArticleDOI
The Cross-Entropy Method for Combinatorial and Continuous Optimization
TL;DR: The mode of a unimodal importance sampling distribution, like the mode of beta distribution, is used as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization.
Journal ArticleDOI
General state space Markov chains and MCMC algorithms
TL;DR: In this paper, a survey of results about Markov chains on non-countable state spaces is presented, along with necessary and sufficient conditions for geometrical and uniform ergodicity along with quantitative bounds on the rate of convergence to stationarity.
Journal ArticleDOI
On A Routing Problem
TL;DR: A modified version of the methods uses a coupling to give strong support to the design principle: It is better with few but quick servers.
References
More filters
Journal ArticleDOI
Asset Pricing with Heterogeneous Consumers
TL;DR: In this paper, a joint process of arbitrage-free asset prices, dividends, and aggregate income is shown to be supported in the equilibrium of an economy with judiciously modeled income heterogeneity.
Journal ArticleDOI
Lower bounds for covering times for reversible Markov chains and random walks on graphs
TL;DR: For simple random walk on aN-vertex graph, the mean time to cover all vertices is at leastcN log(N), wherec>0 is an absolute constant, deduced from a more general result about stationary finite-state reversible Markov chains.
Journal ArticleDOI
The Cross-Entropy Method for Combinatorial and Continuous Optimization
TL;DR: The mode of a unimodal importance sampling distribution, like the mode of beta distribution, is used as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization.
Journal ArticleDOI
On A Routing Problem
TL;DR: A modified version of the methods uses a coupling to give strong support to the design principle: It is better with few but quick servers.
Journal ArticleDOI
Dynamic server allocation to parallel queues with randomly varying connectivity
TL;DR: In a system with a single buffer per queue, an allocation policy is obtained that maximizes the throughput and minimizes the delay when the arrival and service statistics of different queues are identical.