Regenerative Analysis and Steady State Distributions for Markov Chains
From MaRDI portal
Recommendations
Cited in
(92)- Analysis of the stationary \(E_ k/C_ 2/s\) queueing system
- Stationary distributions in a queueing system with vacation times and limited service
- Exploiting the Toeplitz structure in certain queueing problems
- Probabilistic approach to computational algorithms for finding stationary distributions of Markov chains
- Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type
- Optimizing steady state Markov chains by state reduction
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- Analysis of nonpreemptive priority queues with multiple servers and two priority classes
- Perturbation results for nearly uncoupled Markov chains with applications to iterative methods
- Entrywise perturbation theory and error analysis for Markov chains
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
- A direct projection method for Markov chains
- Finding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanish
- Security screening queues with impatient applicants: a new model with a case study
- The computation of the mean first passage times for Markov chains
- Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes
- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- On a two-level multigrid solution method for finite Markov chains
- Modelling traffic queues at a signalized intersection with vehicle- actuated control and Markovian arrival processes
- Accurate numerical solution for structured \(M\)-matrix algebraic Riccati equations
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Parallel computing for Markov chains with islands and ports
- A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service
- Finite-state-space truncations for infinite quasi-birth-death processes
- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
- Efficient computational analysis of non-exhaustive service vacation queues: BMAP/R/1/N() under gated-limited discipline
- On the optimal control of loss probability and profit in a GI /C-BMSP /1/N queueing system
- Highly accurate doubling algorithm for quadratic matrix equation from quasi-birth-and-death process
- Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines
- On the batch arrival batch service queue with finite buffer under server's vacation: \(MX/GY/1/N\) queue
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- Accurate solutions of \(M\)-matrix Sylvester equations
- Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control
- The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
- Steady-state Markov chain models for certain \(q\)-confluent hypergeometric distributions
- Accurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains
- Analysis of the asymmetric shortest queue problem
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
- A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
- Red light green light method for solving large Markov chains
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- Efficient Steady State Analysis of Multimodal Markov Chains
- Matrix structures in queuing models
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- Stationary analysis of a \(\mathrm{BMAP}/\mathrm{R}/1\) queue with \(\mathrm{R}\)-type multiple working vacations
- Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Infinite level-dependent QBD processes and matrix-analytic solutions for stochastic chemical kinetics
- State reduction in a Markov decision process
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- The snowball effect of customer slowdown in critical many-server systems
- Steady-State Approximation for a Vector Valued Markov Chain
- The computation of key properties of Markov chains via perturbations
- Continue, quit, restart probability model
- Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP(a,b)/1/N
- Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)
- Computing absorption probabilities for a Markov chain
- Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas
- Steady-state Markov chain models for the Heine and Euler distributions
- Computing the fundamental matrix for a nonirreducible Markov chain
- Fluid Flow Models and Queues—A Connection by Stochastic Coupling
- Numerical method for discrete-time finite-buffer queues with some regenerative structure
- Optimal stopping of seasonal observations and projection of a Markov chain
- Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators
- scientific article; zbMATH DE number 2160766 (Why is no real title available?)
- ON LATOUCHE–RAMASWAMI'S LOGARITHMIC REDUCTION ALGORITHM FOR QUASI-BIRTH-AND-DEATH PROCESSES
- Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process
- Fast multilevel methods for Markov chains.
- A performance comparison of density-of-states methods
- Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server's vacation
- Case for first courses on finite Markov chain modeling to include sojourn time cycle chart
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization
- Highly accurate Latouche-Ramaswami logarithmic reduction algorithm for quasi-birth-and-death process
- Blockwise perturbation theory for nearly uncoupled Markov chains and its application
- Solving matrix polynomial equations arising in queueing problems
- A note on Newton-Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor
- Four Canadian Contributions to Stochastic Modeling
- Equilibrium analysis of Markov regenerative processes
- Some aspects of stationary characteristics and optimal control of the \(BMAP / G - G / 1 / N( \infty )\) oscillating queueing system
- A stochastic analysis of the dynamic space utilization in warehouses
- Loss probability in an overloaded discrete-time GI/G/1/K system with very large K.
- Accurate numerical solution for shifted M-matrix algebraic Riccati equations
- Analyses of an M/M/N queue with servers' vacations
- On a direct method for the solution of nearly uncoupled Markov chains
- Entrywise relative perturbation bounds for exponentials of essentially non-negative matrices
- The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process
- Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers
This page was built for publication: Regenerative Analysis and Steady State Distributions for Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696262)
