Algorithms for Markov binomial chains

DOI10.46298/LMCS-21(2:28)2025MaRDI QIDQ6960746zbMATH OpenFDO

Authors Alejandro Alarcón Gonzalez, Niel Hens, Tim Leys, Guillermo A. Pérez

Publication date 11 July 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(2:28)2025

zbMATH Keywords

formal verificationMarkov population processes

Mathematics Subject Classification ID

Epidemiology (92D30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computation over the reals, computable analysis (03D78) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 4131650 (Why is no real title available?)
• scientific article; zbMATH DE number 3523369 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• A polynomial time algorithm for computing extinction probabilities of multitype branching processes
• A taxonomy of problems with fast parallel algorithms
• Algorithms for Markov binomial chains
• Asymptotic complexity estimates for probabilistic programs and their VASS abstractions
• Bounding mean first passage times in population continuous-time Markov chains
• Bounding the equilibrium distribution of Markov population models.
• Computation of epidemic final size distributions
• Computational Complexity
• Fluid model checking
• Formalisms for specifying Markovian population models
• Generative abstraction of Markov population processes
• Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
• Long-run average behaviour of probabilistic vector addition systems
• Markov Chains
• Markov population processes
• Model checking Markov population models by stochastic approximations
• Modeling infectious diseases in humans and animals
• On Relating Time and Space to Size and Depth
• On the complexity of calculating factorials
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
• Proceedings of the 14th ACM international conference on hybrid systems: computation and control, HSCC 2011, Chicago, IL, USA, April 12--14, 2011
• The discrete-time Kermack-McKendrick model: a versatile and computationally attractive framework for modeling epidemics

Cited in

(1)

• Algorithms for Markov binomial chains

This page was built for publication: Algorithms for Markov binomial chains

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