On Block Skip Free Transition Matrices and First Passage Times

DOI10.1081/STM-120018139zbMath1022.60069MaRDI QIDQ4798099

María Teresa Gallegos

Publication date: 18 March 2003

Published in: Stochastic Models (Search for Journal in Brave)

zbMATH Keywords

transition matricesM/G/1GI/M/1embedded Markov chainsmean hitting timenon-reversible Markovian star queueing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced partitions for Markov chains
• Partition-Reversible Markov Processes
• General Irreducible Markov Chains and Non-Negative Operators
• Sojourn times in finite Markov processes
• Mean passage times for tridiagonal transition matrices and a two-parameter ehrenfest urn model
• Exact and ordinary lumpability in finite Markov chains
• Applied Probability and Queues
• Mean passage times for tridiagonal transition matrices

This page was built for publication: On Block Skip Free Transition Matrices and First Passage Times