New ways of solving large Markov chains

DOI10.1007/S11134-022-09821-3zbMATH Open1495.60069OpenAlexW4224987990MaRDI QIDQ2146386FDOQ2146386

Authors: Nelly Litvak 

Publication date: 16 June 2022

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-022-09821-3

Recommendations

• scientific article; zbMATH DE number 5177456
• Performance modelling and Markov chains
• Efficient solution for a class of Markov chain models of telecommunication systems
• Numerical Methods in Markov Chain Modeling
• Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain

zbMATH Keywords

Markov chains

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Cites Work

• A scaling analysis of a cat and mouse Markov chain
• Random walk on sparse random digraphs

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Structured analysis approaches for large Markov chains

This page was built for publication: New ways of solving large Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146386)