Computable Bounds on the Spectral Gap for Unreliable Jackson Networks
From MaRDI portal
Publication:5262447
DOI10.1239/aap/1435236981zbMath1329.60319arXiv1101.0332OpenAlexW2963547101MaRDI QIDQ5262447
Publication date: 15 July 2015
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.0332
spectral gapexponential ergodicitybirth-and-death processesCheeger's constantunreliable Jackson networks
Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (5)
On exponential convergence of dynamic queueing network and its applications ⋮ Rate of Convergence to Stationary Distribution for Unreliable Jackson-Type Queueing Network with Dynamic Routing ⋮ Dynamics of finite inhomogeneous particle systems with exclusion interaction ⋮ Analysis of Unreliable Open Queueing Network with Dynamic Routing ⋮ Correlation formulas for Markovian network processes in a random environment
Cites Work
- Strong stationary duality for Möbius monotone Markov chains
- Speed of stability for birth-death processes
- Markov chains and stochastic stability
- Strong stationary times via a new form of duality
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Geometric bounds for eigenvalues of Markov chains
- On the spectrum of Markov semigroups via sample path large deviations
- Spectral gap and convex concentration inequalities for birth-death processes
- On hitting times and fastest strong stationary times for skip-free and more general chains
- On times to quasi-stationarity for birth and death processes
- Stochastic monotonicity and queueing applications of birth-death processes
- Strong stationary duality for continuous-time Markov chains. I: Theory
- Essential spectral radius for Markov semigroups. I: Discrete time case
- Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Exponential \(L_ 2\) convergence of attractive reversible nearest particle systems
- Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases
- Asymptotics of exit times for Markov jump processes. II: Applications to Jackson networks
- A queueing theoretical proof of increasing property of Polya frequency functions
- Computable exponential convergence rates for stochastically ordered Markov processes
- Intertwining and commutation relations for birth-death processes
- On exponential ergodicity and spectral structure for birth-death processes. I
- Geometric renewal convergence rates from hazard rates
- RENEWAL CONVERGENCE RATES FOR DHR AND NWU LIFETIMES
- Series Jackson Networks and Noncrossing Probabilities
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- The relaxation time of two queueing systems in series
- Examples for the Theory of Strong Stationary Duality with Countable State Spaces
- Time to Stationarity for a Continuous-Time Markov Chain
- DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR
- Impact of Routeing on Correlation Strength in Stationary Queueing Network Processes
- Bounds and Asymptotics for the Rate of Convergence of Birth-Death Processes
- Conditions for exponential ergodicity and bounds for the decay parameter of a birth-death process
- ExponentialL 2-convergence andL 2-spectral gap for Markov processes
- On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
- Evaluation of the decay parameter for some specialized birth-death processes
- Lyapounov Functions for Jackson Networks
- Estimation of spectral gap for Markov chains
- The λ-classification of continuous-time birth-and-death processes
- Rates of convergence of stochastically monotone and continuous time Markov models
- Eigenvalues, Inequalities, and Ergodic Theory
- Dependencies in Markovian networks
- Computable Bounds for the Decay Parameter of a Birth–Death Process
- Availability Formulas and Performance Measures for Separable Degradable Networks
- On the spectra of some linear operators associated with queueing systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computable Bounds on the Spectral Gap for Unreliable Jackson Networks
