Approximate lumpability for Markovian agent-based models using local symmetries

DOI10.1017/jpr.2019.44zbMath1436.60073arXiv1804.00910OpenAlexW2977828068WikidataQ127191443 ScholiaQ127191443MaRDI QIDQ5235047

Wasiur R. KhudaBukhsh, Heinz Koeppl, Yann Disser, Arnab Auddy

Publication date: 7 October 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00910

zbMATH Keywords

aggregationfibrationlumpabilitylocal symmetryagent-based models

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chain aggregation and its applications to combinatorial reaction networks
• Lumpability abstractions of rule-based systems
• Mathematics of epidemics on networks. From exact to approximate models
• Exact epidemic models on graphs using graph-automorphism driven lumping
• Graph fibrations and symmetries of network dynamics
• Automorphisms of random graphs with specified vertices
• Markov chain aggregation for agent-based models
• Contact processes on random graphs with power law degree distributions have critical value 0
• A finite characterization of weak lumpable Markov processes. II: The continuous time case
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Graph isomorphism, color refinement, and compactness
• Lifting Markov chains to speed up mixing
• Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
• From exact stochastic to mean-field ODE models: a new approach to prove convergence results
• Optimal Kullback–Leibler Aggregation via Information Bottleneck
• On weak lumpability in Markov chains
• Graph fibrations, graph isomorphism, and PageRank
• The automorphism group of random graphs with a given number of edges
• Random Graph Isomorphism
• Exact and ordinary lumpability in finite Markov chains
• On the asymmetry of random regular graphs and random graphs
• A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
• The Diameter of Sparse Random Graphs
• Validation of Stochastic Systems
• Optimal Kullback-Leibler Aggregation via Spectral Theory of Markov Chains
• Graph isomorphism in quasipolynomial time [extended abstract]
• Fibrations of graphs

This page was built for publication: Approximate lumpability for Markovian agent-based models using local symmetries